Hans-Christoph Wirth

According to our database, Hans-Christoph Wirth authored at least 22 papers between 1998 and 2010.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2010

Relaxed voting and competitive location under monotonous gain functions on trees.

Joachim Spoerhase, Hans-Christoph Wirth

Discret. Appl. Math., 2010

2009

(r, p)-centroid problems on paths and trees.

Joachim Spoerhase, Hans-Christoph Wirth

Theor. Comput. Sci., 2009

Optimally computing all solutions of Stackelberg with parametric prices and of general monotonous gain functions on a tree.

Joachim Spoerhase, Hans-Christoph Wirth

J. Discrete Algorithms, 2009

An O(n(logn)²/loglogn) algorithm for the single maximum coverage location or the (1, X_p)-medianoid problem on trees.

Joachim Spoerhase, Hans-Christoph Wirth

Inf. Process. Lett., 2009

2008

Approximating (<i>r, p</i>)-Centroid on a Path.

Joachim Spoerhase, Hans-Christoph Wirth

Proceedings of the Seventh Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2008

2007

Multiple voting location and single voting location on trees.

Hartmut Noltemeier, Joachim Spoerhase, Hans-Christoph Wirth

Eur. J. Oper. Res., 2007

Relaxed voting and competitive location on trees under monotonous gain functions.

Joachim Spoerhase, Hans-Christoph Wirth

Proceedings of the Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2007

2004

Optimizing cost flows by edge cost and capacity upgrade.

Ingo Demgensky, Hartmut Noltemeier, Hans-Christoph Wirth

J. Discrete Algorithms, 2004

2002

On the flow cost lowering problem.

Ingo Demgensky, Hartmut Noltemeier, Hans-Christoph Wirth

Eur. J. Oper. Res., 2002

Budgeted Maximum Graph Coverage.

Sven Oliver Krumke, Madhav V. Marathe, Diana Poensgen, S. S. Ravi, Hans-Christoph Wirth

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002

2001

Multicriteria Approximation of Network Design and Network Upgrade Problems (Mehrkriterien-Approximation von Netzwerk-Design- und Netzwerk-Ausbau-Problemen)

Hans-Christoph Wirth

PhD thesis, 2001

Reload cost problems: minimum diameter spanning tree.

Hans-Christoph Wirth, Jan Steffan

Discret. Appl. Math., 2001

Upgrading bottleneck constrained forests.

Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, S. S. Ravi, Hans-Christoph Wirth

Discret. Appl. Math., 2001

Euler is standing in line dial-a-ride problems with precedence-constraints.

Dietrich Hauptmeier, Sven Oliver Krumke, Jörg Rambau, Hans-Christoph Wirth

Discret. Appl. Math., 2001

Multiple Hotlink Assignment.

Sven Fuhrmann, Sven Oliver Krumke, Hans-Christoph Wirth

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2001

2000

Optimizing Cost Flows by Modifying Arc Costs and Capacities.

Ingo Demgensky, Hartmut Noltemeier, Hans-Christoph Wirth

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2000

1999

Improving Spanning Trees by Upgrading Nodes.

Sven Oliver Krumke, Hartmut Noltemeier, Madhav V. Marathe, R. Ravi, S. S. Ravi, Ravi Sundaram, Hans-Christoph Wirth

Theor. Comput. Sci., 1999

Improving Minimum Cost Spanning Trees by Upgrading Nodes.

Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi, Ravi Sundaram, Hans-Christoph Wirth

J. Algorithms, 1999

Network Design and Improvement.

Hartmut Noltemeier, Hans-Christoph Wirth, Sven Oliver Krumke

ACM Comput. Surv., 1999

On Minimum Diameter Spanning Trees under Reload Costs.

Hans-Christoph Wirth, Jan Steffan

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1999

Euler is Standing in Line.

Dietrich Hauptmeier, Sven Oliver Krumke, Jörg Rambau, Hans-Christoph Wirth

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1999

1998

On the Minimum Label Spanning Tree Problem.

Sven Oliver Krumke, Hans-Christoph Wirth

Inf. Process. Lett., 1998