Insertion Heuristics for (1,2)-TSP

Ekin Ergen ()
Additional contact information
Ekin Ergen: Technische Universität Berlin

Chapter Chapter 69 in Operations Research Proceedings 2023, 2025, pp 543-549 from Springer

Abstract: Abstract Insertion heuristics are approximation algorithms that are widely used in practice to solve the traveling salesperson problem (TSP) which is arguably among the most prominent problems in combinatorial optimization. In this paper, we analyze well-known variants of insertion heuristics restricted to instances with edge weights in $$\{1,2\}$$ { 1 , 2 } , deriving the exact approximation ratio of 7/4 for multiple variants. These ratios yield the first tight bounds known for arbitrary insertion heuristic and the farthest insertion heuristic for any class on which TSP is NP-complete.

Keywords: Traveling salesperson problem; Approximation algorithms (search for similar items in EconPapers)
Date: 2025
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:lnopch:978-3-031-58405-3_69

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

DOI: 10.1007/978-3-031-58405-3_69

Access Statistics for this chapter

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