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

Alexey E. Baburin and Edward Kh. Gimadi
Additional contact information
Alexey E. Baburin: Sobolev Institute of Mathematics
Edward Kh. Gimadi: Sobolev Institute of Mathematics

A chapter in Operations Research Proceedings 2004, 2005, pp 343-351 from Springer

Abstract: Abstract In the paper a problem of finding a maximum-weight spanning connected subgraph with given vertex degrees is considered. The problem is MAX SNP-hard, because it is a generalization of a well-known Traveling Salesman Problem. Approximation algorithms are constructed for deterministic and random instances. Performance bounds of these algorithms are presented.

Keywords: Approximation Algorithm; Independent Random Variable; Performance Estimate; Performance Ratio; Random Instance (search for similar items in EconPapers)
Date: 2005
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-540-27679-1_43

Ordering information: This item can be ordered from
http://www.springer.com/9783540276791

DOI: 10.1007/3-540-27679-3_43

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().