Approximation Algorithms for Finding a Maximum-Weight Spanning Connected Subgraph with given Vertex Degrees

Alexey Baburin, Edward Gimadi. Approximation Algorithms for Finding a Maximum-Weight Spanning Connected Subgraph with given Vertex Degrees. In Hein A. Fleuren, Dick den Hertog, Peter M. Kort, editors, Operations Research, Proceedings 2004, Selected Papers of the Annual International Conference of the German Operations Research Society (GOR), Jointly Organized with the Netherlands Society for Operations Research (NGB), Tilburg, The Netherlands, Septembe. pages 343-351, 2004. [doi]

Abstract

Abstract is missing.