Approximation algorithms for traveling salesman problems:
The Traveling Salesman Problem (TSP) is a central topic in discrete mathematics and theoretical computer science. It has been one of the driving forces in combinatorial optimization. The design and analysis of better and better approximation algorithms for the TSP has proved challenging but very fru...
Gespeichert in:
| Beteiligte Personen: | , |
|---|---|
| Format: | Elektronisch E-Book |
| Sprache: | Englisch |
| Veröffentlicht: |
Cambridge ; New York, NY
Cambridge University Press
2025
|
| Schlagwörter: | |
| Links: | https://doi.org/10.1017/9781009445436?locatt=mode:legacy https://doi.org/10.1017/9781009445436?locatt=mode:legacy https://doi.org/10.1017/9781009445436?locatt=mode:legacy https://doi.org/10.1017/9781009445436?locatt=mode:legacy |
| Zusammenfassung: | The Traveling Salesman Problem (TSP) is a central topic in discrete mathematics and theoretical computer science. It has been one of the driving forces in combinatorial optimization. The design and analysis of better and better approximation algorithms for the TSP has proved challenging but very fruitful. This is the first book on approximation algorithms for the TSP, featuring a comprehensive collection of all major results and an overview of the most intriguing open problems. Many of the presented results have been discovered only recently, and some are published here for the first time, including better approximation algorithms for the asymmetric TSP and its path version. This book constitutes and advances the state of the art and makes it accessible to a wider audience. Featuring detailed proofs, over 170 exercises, and 100 color figures, this book is an excellent resource for teaching, self-study, and further research |
| Beschreibung: | Title from publisher's bibliographic system (viewed on 15 Nov 2024) Linear programming relaxations of the symmetric TSP -- Linear programming relaxations of the asymmetric TSP -- Duality, cuts, and uncrossing -- Thin trees and random trees -- Asymmetric graph TSP -- Constant-factor approximation for the asymmetric TSP -- Algorithms for subtour cover -- Asymmetric path TSP -- Parity correction of random trees -- Proving the main payment theorem for hierarchies -- Removable pairings -- Ear-decompositions, matchings, and matroids -- Symmetric path TSP and T-tours -- Best-of-many Christofides and variants -- Path TSP by dynamic programming -- Further results, related problems -- State of the art, open problems |
| Umfang: | 1 Online-Ressource (xiv, 427 Seiten) |
| ISBN: | 9781009445436 |
| DOI: | 10.1017/9781009445436 |
Internformat
MARC
| LEADER | 00000nam a2200000zc 4500 | ||
|---|---|---|---|
| 001 | BV050110609 | ||
| 003 | DE-604 | ||
| 007 | cr|uuu---uuuuu | ||
| 008 | 250107s2025 xx o|||| 00||| eng d | ||
| 020 | |a 9781009445436 |c Online |9 978-1-009-44543-6 | ||
| 024 | 7 | |a 10.1017/9781009445436 |2 doi | |
| 035 | |a (ZDB-20-CBO)CR9781009445436 | ||
| 035 | |a (OCoLC)1492132389 | ||
| 035 | |a (DE-599)BVBBV050110609 | ||
| 040 | |a DE-604 |b ger |e rda | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-12 |a DE-92 |a DE-634 | ||
| 082 | 0 | |a 511/.5 | |
| 100 | 1 | |a Traub, Vera |d 1994- |0 (DE-588)1088346359 |4 aut | |
| 245 | 1 | 0 | |a Approximation algorithms for traveling salesman problems |c Vera Traub, Jens Vygen |
| 264 | 1 | |a Cambridge ; New York, NY |b Cambridge University Press |c 2025 | |
| 300 | |a 1 Online-Ressource (xiv, 427 Seiten) | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b c |2 rdamedia | ||
| 338 | |b cr |2 rdacarrier | ||
| 500 | |a Title from publisher's bibliographic system (viewed on 15 Nov 2024) | ||
| 500 | |a Linear programming relaxations of the symmetric TSP -- Linear programming relaxations of the asymmetric TSP -- Duality, cuts, and uncrossing -- Thin trees and random trees -- Asymmetric graph TSP -- Constant-factor approximation for the asymmetric TSP -- Algorithms for subtour cover -- Asymmetric path TSP -- Parity correction of random trees -- Proving the main payment theorem for hierarchies -- Removable pairings -- Ear-decompositions, matchings, and matroids -- Symmetric path TSP and T-tours -- Best-of-many Christofides and variants -- Path TSP by dynamic programming -- Further results, related problems -- State of the art, open problems | ||
| 520 | |a The Traveling Salesman Problem (TSP) is a central topic in discrete mathematics and theoretical computer science. It has been one of the driving forces in combinatorial optimization. The design and analysis of better and better approximation algorithms for the TSP has proved challenging but very fruitful. This is the first book on approximation algorithms for the TSP, featuring a comprehensive collection of all major results and an overview of the most intriguing open problems. Many of the presented results have been discovered only recently, and some are published here for the first time, including better approximation algorithms for the asymmetric TSP and its path version. This book constitutes and advances the state of the art and makes it accessible to a wider audience. Featuring detailed proofs, over 170 exercises, and 100 color figures, this book is an excellent resource for teaching, self-study, and further research | ||
| 650 | 4 | |a Traveling salesman problem | |
| 650 | 4 | |a Approximation algorithms | |
| 700 | 1 | |a Vygen, Jens |d 1967- |0 (DE-588)14204086X |4 aut | |
| 776 | 0 | 8 | |i Erscheint auch als |n Druck-Ausgabe |z 9781009445412 |
| 856 | 4 | 0 | |u https://doi.org/10.1017/9781009445436?locatt=mode:legacy |x Verlag |z URL des Erstveröffentlichers |3 Volltext |
| 912 | |a ZDB-20-CBO | ||
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-035447619 | |
| 966 | e | |u https://doi.org/10.1017/9781009445436?locatt=mode:legacy |l DE-12 |p ZDB-20-CBO |q BSB_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/9781009445436?locatt=mode:legacy |l DE-634 |p ZDB-20-CBO |q BTU_PDA_CBO |x Verlag |3 Volltext | |
| 966 | e | |u https://doi.org/10.1017/9781009445436?locatt=mode:legacy |l DE-92 |p ZDB-20-CBO |q FHN_PDA_CBO |x Verlag |3 Volltext | |
Datensatz im Suchindex
| _version_ | 1824030329000689664 |
|---|---|
| adam_text | |
| any_adam_object | |
| author | Traub, Vera 1994- Vygen, Jens 1967- |
| author_GND | (DE-588)1088346359 (DE-588)14204086X |
| author_facet | Traub, Vera 1994- Vygen, Jens 1967- |
| author_role | aut aut |
| author_sort | Traub, Vera 1994- |
| author_variant | v t vt j v jv |
| building | Verbundindex |
| bvnumber | BV050110609 |
| collection | ZDB-20-CBO |
| ctrlnum | (ZDB-20-CBO)CR9781009445436 (OCoLC)1492132389 (DE-599)BVBBV050110609 |
| dewey-full | 511/.5 |
| dewey-hundreds | 500 - Natural sciences and mathematics |
| dewey-ones | 511 - General principles of mathematics |
| dewey-raw | 511/.5 |
| dewey-search | 511/.5 |
| dewey-sort | 3511 15 |
| dewey-tens | 510 - Mathematics |
| discipline | Mathematik |
| doi_str_mv | 10.1017/9781009445436 |
| format | Electronic eBook |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>00000nam a2200000zc 4500</leader><controlfield tag="001">BV050110609</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="007">cr|uuu---uuuuu</controlfield><controlfield tag="008">250107s2025 xx o|||| 00||| eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9781009445436</subfield><subfield code="c">Online</subfield><subfield code="9">978-1-009-44543-6</subfield></datafield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1017/9781009445436</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(ZDB-20-CBO)CR9781009445436</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1492132389</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV050110609</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-12</subfield><subfield code="a">DE-92</subfield><subfield code="a">DE-634</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">511/.5</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Traub, Vera</subfield><subfield code="d">1994-</subfield><subfield code="0">(DE-588)1088346359</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Approximation algorithms for traveling salesman problems</subfield><subfield code="c">Vera Traub, Jens Vygen</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge ; New York, NY</subfield><subfield code="b">Cambridge University Press</subfield><subfield code="c">2025</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 Online-Ressource (xiv, 427 Seiten)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Title from publisher's bibliographic system (viewed on 15 Nov 2024)</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Linear programming relaxations of the symmetric TSP -- Linear programming relaxations of the asymmetric TSP -- Duality, cuts, and uncrossing -- Thin trees and random trees -- Asymmetric graph TSP -- Constant-factor approximation for the asymmetric TSP -- Algorithms for subtour cover -- Asymmetric path TSP -- Parity correction of random trees -- Proving the main payment theorem for hierarchies -- Removable pairings -- Ear-decompositions, matchings, and matroids -- Symmetric path TSP and T-tours -- Best-of-many Christofides and variants -- Path TSP by dynamic programming -- Further results, related problems -- State of the art, open problems</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">The Traveling Salesman Problem (TSP) is a central topic in discrete mathematics and theoretical computer science. It has been one of the driving forces in combinatorial optimization. The design and analysis of better and better approximation algorithms for the TSP has proved challenging but very fruitful. This is the first book on approximation algorithms for the TSP, featuring a comprehensive collection of all major results and an overview of the most intriguing open problems. Many of the presented results have been discovered only recently, and some are published here for the first time, including better approximation algorithms for the asymmetric TSP and its path version. This book constitutes and advances the state of the art and makes it accessible to a wider audience. Featuring detailed proofs, over 170 exercises, and 100 color figures, this book is an excellent resource for teaching, self-study, and further research</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Traveling salesman problem</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Approximation algorithms</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Vygen, Jens</subfield><subfield code="d">1967-</subfield><subfield code="0">(DE-588)14204086X</subfield><subfield code="4">aut</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Druck-Ausgabe</subfield><subfield code="z">9781009445412</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1017/9781009445436?locatt=mode:legacy</subfield><subfield code="x">Verlag</subfield><subfield code="z">URL des Erstveröffentlichers</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">ZDB-20-CBO</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-035447619</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/9781009445436?locatt=mode:legacy</subfield><subfield code="l">DE-12</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">BSB_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/9781009445436?locatt=mode:legacy</subfield><subfield code="l">DE-634</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">BTU_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="966" ind1="e" ind2=" "><subfield code="u">https://doi.org/10.1017/9781009445436?locatt=mode:legacy</subfield><subfield code="l">DE-92</subfield><subfield code="p">ZDB-20-CBO</subfield><subfield code="q">FHN_PDA_CBO</subfield><subfield code="x">Verlag</subfield><subfield code="3">Volltext</subfield></datafield></record></collection> |
| id | DE-604.BV050110609 |
| illustrated | Not Illustrated |
| indexdate | 2025-02-14T11:01:16Z |
| institution | BVB |
| isbn | 9781009445436 |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-035447619 |
| oclc_num | 1492132389 |
| open_access_boolean | |
| owner | DE-12 DE-92 DE-634 |
| owner_facet | DE-12 DE-92 DE-634 |
| physical | 1 Online-Ressource (xiv, 427 Seiten) |
| psigel | ZDB-20-CBO ZDB-20-CBO BSB_PDA_CBO ZDB-20-CBO BTU_PDA_CBO ZDB-20-CBO FHN_PDA_CBO |
| publishDate | 2025 |
| publishDateSearch | 2025 |
| publishDateSort | 2025 |
| publisher | Cambridge University Press |
| record_format | marc |
| spelling | Traub, Vera 1994- (DE-588)1088346359 aut Approximation algorithms for traveling salesman problems Vera Traub, Jens Vygen Cambridge ; New York, NY Cambridge University Press 2025 1 Online-Ressource (xiv, 427 Seiten) txt rdacontent c rdamedia cr rdacarrier Title from publisher's bibliographic system (viewed on 15 Nov 2024) Linear programming relaxations of the symmetric TSP -- Linear programming relaxations of the asymmetric TSP -- Duality, cuts, and uncrossing -- Thin trees and random trees -- Asymmetric graph TSP -- Constant-factor approximation for the asymmetric TSP -- Algorithms for subtour cover -- Asymmetric path TSP -- Parity correction of random trees -- Proving the main payment theorem for hierarchies -- Removable pairings -- Ear-decompositions, matchings, and matroids -- Symmetric path TSP and T-tours -- Best-of-many Christofides and variants -- Path TSP by dynamic programming -- Further results, related problems -- State of the art, open problems The Traveling Salesman Problem (TSP) is a central topic in discrete mathematics and theoretical computer science. It has been one of the driving forces in combinatorial optimization. The design and analysis of better and better approximation algorithms for the TSP has proved challenging but very fruitful. This is the first book on approximation algorithms for the TSP, featuring a comprehensive collection of all major results and an overview of the most intriguing open problems. Many of the presented results have been discovered only recently, and some are published here for the first time, including better approximation algorithms for the asymmetric TSP and its path version. This book constitutes and advances the state of the art and makes it accessible to a wider audience. Featuring detailed proofs, over 170 exercises, and 100 color figures, this book is an excellent resource for teaching, self-study, and further research Traveling salesman problem Approximation algorithms Vygen, Jens 1967- (DE-588)14204086X aut Erscheint auch als Druck-Ausgabe 9781009445412 https://doi.org/10.1017/9781009445436?locatt=mode:legacy Verlag URL des Erstveröffentlichers Volltext |
| spellingShingle | Traub, Vera 1994- Vygen, Jens 1967- Approximation algorithms for traveling salesman problems Traveling salesman problem Approximation algorithms |
| title | Approximation algorithms for traveling salesman problems |
| title_auth | Approximation algorithms for traveling salesman problems |
| title_exact_search | Approximation algorithms for traveling salesman problems |
| title_full | Approximation algorithms for traveling salesman problems Vera Traub, Jens Vygen |
| title_fullStr | Approximation algorithms for traveling salesman problems Vera Traub, Jens Vygen |
| title_full_unstemmed | Approximation algorithms for traveling salesman problems Vera Traub, Jens Vygen |
| title_short | Approximation algorithms for traveling salesman problems |
| title_sort | approximation algorithms for traveling salesman problems |
| topic | Traveling salesman problem Approximation algorithms |
| topic_facet | Traveling salesman problem Approximation algorithms |
| url | https://doi.org/10.1017/9781009445436?locatt=mode:legacy |
| work_keys_str_mv | AT traubvera approximationalgorithmsfortravelingsalesmanproblems AT vygenjens approximationalgorithmsfortravelingsalesmanproblems |