#### Filter Results:

#### Publication Year

1997

2010

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Sven Oliver Krumke, Hans-Christoph Wirth
- Inf. Process. Lett.
- 1998

- Hans-Christoph Wirth, Jan Steffan
- Discrete Applied Mathematics
- 2001

- Hartmut Noltemeier, Joachim Spoerhase, Hans-Christoph Wirth
- European Journal of Operational Research
- 2007

- Sven Oliver Krumke, Hartmut Noltemeier, Madhav V. Marathe, R. Ravi, S. S. Ravi, Ravi Sundaram +1 other
- Theor. Comput. Sci.
- 1997

Energy. The Los Alamos National Laboratory strongly supports academic freedom and a researcher's right to publish; as an institution, however, the Laboratory does not endorse this viewpoint of a publication or guarantee its technical correctness. Abstract Id: upgrade.tex,v 2.2 1997709918 13:14:08 krumke Exp wirth We study bottleneck constrained network… (More)

- Sven Oliver Krumke, Madhav V. Marathe, Hartmut Noltemeier, R. Ravi, S. S. Ravi, Ravi Sundaram +1 other
- J. Algorithms
- 1999

We study budget constrained network upgrading problems. We are given an undirected edge weighted graph G = (V; E) where node v 2 V can be upgraded at a cost of c(v). This upgrade reduces the weight of each edge incident on v. The goal is to find a minimum cost set of nodes to be upgraded so that the resulting network has a minimum spanning tree of weight no… (More)

- Joachim Spoerhase, Hans-Christoph Wirth
- Theor. Comput. Sci.
- 2009

An instance of the (r, p)-centroid problem is given by an edge and node weighted graph. Two competitors, the leader and the follower, are allowed to place p or r facilities, respectively, into the graph. Users at the nodes connect to the closest facility. A solution of the (r, p)-centroid problem is a leader placement such that the maximum total weight of… (More)

An instance of the maximum coverage problem is given by a set of weighted ground elements and a cost weighted family of subsets of the ground element set. The goal is to select a subfamily of total cost of at most that of a given budget maximizing the weight of the covered elements. We formulate the problem on graphs: In this situation the set of ground… (More)

- Ingo Demgensky, Hartmut Noltemeier, Hans-Christoph Wirth
- European Journal of Operational Research
- 2002

- Hartmut Noltemeier, Hans-Christoph Wirth, Sven Oliver Krumke
- ACM Comput. Surv.
- 1999

Inspired by the fact that many combinatorial optimization problems arising in practice are NP-hard, the design of efficient approximation algorithms has been a major research topic for the last years. Since we can not expect to solve any NP-hard problem in polynomial time, it is meaningful to compromise optimality of a solution and settle for a "… (More)