Approximation Polynomial Algorithms for Some Modifications of TSP

Edward Gimadi ()
Additional contact information
Edward Gimadi: Sobolev Institute of Mathematics SB RAS,

Chapter 72 in Operations Research Proceedings 2008, 2009, pp 445-450 from Springer

Abstract: Summary In the report polynomial approximation algorithms with performance guarantees are presented for some modifications of TSP: for the minimum-weigt 2-PSP on metric distances and for the maximum-weight m- PSP in Euclidean space Rk.

Keywords: Edge Weight; Travel Salesman Problem; Travel Salesman Problem; Hamiltonian Cycle; Performance Ratio (search for similar items in EconPapers)
Date: 2009
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:sprchp:978-3-642-00142-0_72

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

DOI: 10.1007/978-3-642-00142-0_72

Access Statistics for this chapter

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