( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Improving Minimum Cost Spanning Trees by Upgrading Nodes.

, , , , , , и . J. Algorithms, 33 (1): 92-111 (1999)

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.

Hans-Christoph Wirth

Christoph Wirth

Hans Wirth

Hans Wirth

Hans Wirth

 

Другие публикации лиц с тем же именем

Security Score, Plurality Solution, and Nash Equilibrium in Multiple Location Problems, и . 20th European Chapter on Combinatorial Optimization (ECCO'07), (2007)Relaxed Voting and Competitive Location on Trees under Monotonuous Gain Functions, и . 6th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW'07), (2007)Approximating (r,p)-centroid on a path, и . Proc. 7th Cologne-Twente Workshop on Graphs and Combinatorial Optimization (CTW'08), (2008)Multiple Hotlink Assignment., , и . WG, том 2204 из Lecture Notes in Computer Science, стр. 189-200. Springer, (2001)On Minimum Diameter Spanning Trees under Reload Costs., и . WG, том 1665 из Lecture Notes in Computer Science, стр. 78-88. Springer, (1999)Optimizing Cost Flows by Modifying Arc Costs and Capacities., , и . WG, том 1928 из Lecture Notes in Computer Science, стр. 116-126. Springer, (2000)On the flow cost lowering problem., , и . Eur. J. Oper. Res., 137 (2): 265-271 (2002)Euler is Standing in Line., , , и . WG, том 1665 из Lecture Notes in Computer Science, стр. 42-54. Springer, (1999)Relaxed voting and competitive location on trees under monotonous gain functions., и . CTW, стр. 137-140. University of Twente, (2007)Reload cost problems: minimum diameter spanning tree., и . Discret. Appl. Math., 113 (1): 73-85 (2001)