( en | de | ru )

 

Disambiguation of "König, Jean-Claude"

Author of the publication

copydeleteadd this publication to your clipboard
Construction of low-cost and low-diameter Steiner trees for multipoint groups.

, , and . SIROCCO, page 197-210. Carleton Scientific, (2000)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Jean-Claude Heilig

Jean-Claude Jaquet

Jean-Claude Nkurikiyinka

Jean-Claude Eischen

Jean-Claude Fernandez

 

Other publications of authors with the same name

Polynomial-time algorithms for scheduling problem for coupled-tasks in presence of treatment tasks., , and . Electron. Notes Discret. Math., (2010)Scheduling in the presence of processor networks : complexity and approximation., , , and . RAIRO Oper. Res., 46 (1): 1-22 (2012)On the List Colouring Problem., , and . ASIAN, volume 2550 of Lecture Notes in Computer Science, page 47-56. Springer, (2002)Optimal Schedules for d-D Grid Graphs with Communication Delays., , and . Parallel Comput., 24 (11): 1653-1664 (1998)Scheduling Algorithms for Parallel Gaussian Elimination With Communication Costs., , and . IEEE Trans. Parallel Distributed Syst., 9 (7): 679-686 (1998)General and Efficient Decentralized Consensus Protocols., , and . WDAG, volume 312 of Lecture Notes in Computer Science, page 41-56. Springer, (1987)Complexity and Approximation for the Precedence Constrained Scheduling Problem with Large Communication Delays., , , and . Euro-Par, volume 3648 of Lecture Notes in Computer Science, page 252-261. Springer, (2005)Optimal Schedules for d-D Grid Graphs with Communication Delays (Extended Abstract)., , and . STACS, volume 1046 of Lecture Notes in Computer Science, page 655-666. Springer, (1996)AT-Dist: Distributed Localization Method with High Accuracy in Sensor Networks., , and . Stud. Inform. Univ., 6 (1): 14-39 (2008)Complexity and inapproximability results for balanced connected subgraph problem., , , , and . Theor. Comput. Sci., (2021)