Flow Improvement and Network Flows with Fixed Costs (2000)
S. O. Krumke, Konrad-zuse-zentrum Fur Informationstechnik Berlin, H. Noltemeier, S. Schwarz, H. -c. Wirth
this paper are NP-hard to solve. We present various approximation algorithms for the problems under study.
Improving Minimum Cost Spanning Trees by Upgrading Nodes (1999)
S. O. Krumke, M. V. Marathe, H. Noltemeier, R. Ravi, S. S. Ravi, R. Sundaram, ...
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...
Modifying Edges of a Network to Obtain Short Subgroups (1998)
K. U. Drangmeister, S. O. Krumke, M. V. Marathe, H. Noltemeier, S. S. Ravi
This paper considers problems of the following type: We are given an edge weighted graph G =#V;E#. It is assumed that each edge e of the given network has an associated function c e that speci#es the...
Upgrading Bottleneck Constrained Forests (1998)
S. O. Krumke, M. V. Marathe, H. Noltemeier, S. S. Ravi
. We study bottleneck constrained network upgrading problems. We are given an edge weighted graph G = (V; E) where node v 2 V can be upgraded at a cost of c(v). This upgrade reduces the delay of each...
Improving Spanning Trees by Upgrading Nodes (1998)
M. V. Marathe, H. Noltemeier, R. Ravi, S. S. Ravi, R. Sundaram, H. C. Wirth
. We study budget constrained optimal network upgrading problems. We are given an edge weighted graph G = (V; E) where node v 2 V can be upgraded at a cost of c(v). This upgrade reduces the delay of...
Modifying Networks to Obtain Low Cost Trees (1998)
S. O. Krumke, H. Noltemeier, M. V. Marathe, S. S. Ravi, K. U. Drangmeister
We consider the problem of reducing the edge lengths of a given network so that the modified network has a spanning tree of small total length. It is assumed that each edge e of the given network has...
Complexity and Approximability of Certain Bicriteria Location Problems (1998)
S. O. Krumke, H. Noltemeier, S. S. Ravi, M. V. Marathe
. We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the selection of a...
Compact Location Problems (1998)
S. O. Krumke, M. V. Marathe, H. Noltemeier, V. Radhakrishnan, S. S. Ravi, D. J. Rosenkrantz
We consider the problem of placing a specified number (p) of facilities on the nodes of a network so as to minimize some measure of the distances between facilities. This type of problem models a...
Compact Location Problems with Budget and Communication Constraints (1998)
S. O. Krumke, H. Noltemeier, S. S. Ravi, M. V. Marathe
. We consider the problem of placing a specified number p of facilities on the nodes of a given network with two nonnegative edge-- weight functions so as to minimize the diameter of the placement...
Compact Location Problems (1998)
S. O. Krumke, M. V. Marathe, H. Noltemeier, V. Radhakrishnan, S. S. Ravi, D. J. Rosenkrantz
We consider the problem of placing a specified number (p) of facilities on the nodes of a network so as to minimize some measure of the distances between facilities. This type of problem models a...
Complexity and Approximability of Certain Bicriteria Location Problems (1998)
S. O. Krumke, H. Noltemeier, S. S. Ravi, M. V. Marathe
. We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the selection of a...
Compact Location Problems with Budget and Communication Constraints (1998)
S. O. Krumke, H. Noltemeier, S. S. Ravi, M. V. Marathe
. We consider the problem of placing a specified number p of facilities on the nodes of a given network with two nonnegative edge-- weight functions so as to minimize the diameter of the placement...
Bicriteria Compact Location Problems (1998)
Sven O. Krumke, H. Noltemeier, S. S. Ravi, Madhav V. Marathe
We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the selection of a...
Modifying Networks to Obtain Low Cost Trees (1998)
S. O. Krumke, H. Noltemeier, M. V. Marathe, S. S. Ravi, K. U. Drangmeister
We consider the problem of reducing the edge lengths of a given network so that the modified network has a spanning tree of small total length. It is assumed that each edge e of the given network has...
Improving Spanning Trees by Upgrading Nodes (1998)
M. V. Marathe, H. Noltemeier, R. Ravi, S. S. Ravi, R. Sundaram, H. C. Wirth
. We study budget constrained optimal network upgrading problems. We are given an edge weighted graph G = (V; E) where node v 2 V can be upgraded at a cost of c(v). This upgrade reduces the delay of...
Compact Location Problems (1998)
S. O. Krumke, M. V. Marathe, H. Noltemeier, V. Radhakrishnan, S. S. Ravi, D. J. Rosenkrantz
We consider the problem of placing a specified number (p) of facilities on the nodes of a network so as to minimize some measure of the distances between facilities. This type of problem models a...
Complexity and Approximability of Certain Bicriteria Location Problems (1998)
S. O. Krumke, H. Noltemeier, S. S. Ravi, M. V. Marathe
. We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the selection of a...
Bicriteria Compact Location Problems (1998)
Sven O. Krumke, H. Noltemeier, S. S. Ravi, Madhav V. Marathe
We investigate the complexity and approximability of some location problems when two distance values are specified for each pair of potential sites. These problems involve the selection of a...
Compact Location Problems with Budget and Communication Constraints (1998)
S. O. Krumke, H. Noltemeier, S. S. Ravi, M. V. Marathe
. We consider the problem of placing a specified number p of facilities on the nodes of a given network with two nonnegative edge-- weight functions so as to minimize the diameter of the placement...
Compact Location Problems (1970)
S. O. Krumke, M. V. Marathe, H. Noltemeier, V. Radhakrishnan, S. S. Ravi, D. J. Rosenkrantz
We consider the problem of placing a specified number (p) of facilities on the nodes of a network so as to minimize some measure of the distances between facilities. This type of problem models a...
Improving Minimum Cost Spanning Trees by Upgrading Nodes (1970)
S. O. Krumke, M. V. Marathe, H. Noltemeier, R. Ravi, S. S. Ravi, R. Sundaram, ...
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...
Upgrading Bottleneck Constrained Forests (1970)
S. O. Krumke, M. V. Marathe, H. Noltemeier, S. S. Ravi, H. -c. Wirth
. We study bottleneck constrained network upgrading problems. We are given an edge weighted graph G = (V; E) where node v 2 V can be upgraded at a cost of c(v). This upgrade reduces the delay of each...
Multiple voting location and single voting location on trees
Noltemeier, H., Spoerhase, J., Wirth, H.-C.
On the flow cost lowering problem
Demgensky, I., Noltemeier, H., Wirth, H. -C.