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...
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...
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...