Polynomial Algorithms for Some Hard Problems of Finding Connected Spanning Subgraphs of Extreme Total Edge Weight

Alexey Baburin () and Edward Gimadi ()
Additional contact information
Alexey Baburin: Sobolev Institute of Mathematics SB RAS
Edward Gimadi: Sobolev Institute of Mathematics SB RAS

A chapter in Operations Research Proceedings 2006, 2007, pp 215-220 from Springer

Abstract: Abstract Several hard optimization problems of finding spanning connected subgraphs with extreme total edge weight are considered. A number of results on constructing polynomial algorithms with performance guarantees for these problems is presented.1

Keywords: Travel Salesman Problem; Hamiltonian Cycle; Performance Ratio; Polynomial Algorithm; Performance Guarantee (search for similar items in EconPapers)
Date: 2007
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-69995-8_36

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

DOI: 10.1007/978-3-540-69995-8_36

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