Approximation Algorithms for Traveling Salesman Problems
portes grátis
Approximation Algorithms for Traveling Salesman Problems
Vygen, Jens; Traub, Vera
Cambridge University Press
10/2024
439
Dura
9781009445412
Pré-lançamento - envio 15 a 20 dias após a sua edição
Descrição não disponível.
Preface; 1. Introduction; 2. Linear programming relaxations of the Symmetric TSP; 3. Linear programming relaxations of the Asymmetric TSP; 4. Duality, cuts, and uncrossing; 5. Thin trees and random trees; 6. Asymmetric Graph TSP; 7. Constant-factor approximation for the Asymmetric TSP; 8. Algorithms for subtour cover; 9. Asymmetric Path TSP; 10. Parity correction of random trees; 11. Proving the main payment theorem for hierarchies; 12. Removable pairings; 13. Ear-Decompositions, matchings, and matroids; 14. Symmetric Path TSP and T-tours; 15. Best-of-Many Christofides and variants; 16. Path TSP by dynamic programming; 17. Further results, related problems; 18. State of the art, open problems; Bibliography; Index.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
Preface; 1. Introduction; 2. Linear programming relaxations of the Symmetric TSP; 3. Linear programming relaxations of the Asymmetric TSP; 4. Duality, cuts, and uncrossing; 5. Thin trees and random trees; 6. Asymmetric Graph TSP; 7. Constant-factor approximation for the Asymmetric TSP; 8. Algorithms for subtour cover; 9. Asymmetric Path TSP; 10. Parity correction of random trees; 11. Proving the main payment theorem for hierarchies; 12. Removable pairings; 13. Ear-Decompositions, matchings, and matroids; 14. Symmetric Path TSP and T-tours; 15. Best-of-Many Christofides and variants; 16. Path TSP by dynamic programming; 17. Further results, related problems; 18. State of the art, open problems; Bibliography; Index.
Este título pertence ao(s) assunto(s) indicados(s). Para ver outros títulos clique no assunto desejado.
