Traub, Vera: Approximation Algorithms for Traveling Salesman Problems. - Bonn, 2020. - Dissertation, Rheinische Friedrich-Wilhelms-Universität Bonn.

Online-Ausgabe in bonndoc: https://nbn-resolving.org/urn:nbn:de:hbz:5n-58344

Online-Ausgabe in bonndoc: https://nbn-resolving.org/urn:nbn:de:hbz:5n-58344

@phdthesis{handle:20.500.11811/8310,

urn: https://nbn-resolving.org/urn:nbn:de:hbz:5n-58344,

author = {{Vera Traub}},

title = {Approximation Algorithms for Traveling Salesman Problems},

school = {Rheinische Friedrich-Wilhelms-Universität Bonn},

year = 2020,

month = apr,

note = {The traveling salesman problem is the probably most famous problem in combinatorial optimization. Given a graph G and nonnegative edge costs, we want to find a closed walk in G that visits every vertex at least once and has minimum cost. We consider both the symmetric traveling salesman problem (TSP) where G is an undirected graph and the asymmetric traveling salesman problem (ATSP) where G is a directed graph. We also investigate the unit-weight special cases and the more general path versions, where we do not require the walk to be closed, but to start and end in prescribed vertices s and t.

In this thesis we give improved approximation algorithms and better upper bounds on the integrality ratio of the classical linear programming relaxations for several of these traveling salesman problems. For this we use techniques arising from various parts of combinatorial optimization such as linear programming, network flows, ear-decompositions, matroids, and T-joins.

Our results include a (22 + &epsilon)-approximation algorithm for ATSP (for any &epsilon > 0), the first constant upper bound on the integrality ratio for s-t-path ATSP, a new upper bound on the integrality ratio for s-t-path TSP, and a black-box reduction from s-t-path TSP to TSP.},

url = {https://hdl.handle.net/20.500.11811/8310}

}

urn: https://nbn-resolving.org/urn:nbn:de:hbz:5n-58344,

author = {{Vera Traub}},

title = {Approximation Algorithms for Traveling Salesman Problems},

school = {Rheinische Friedrich-Wilhelms-Universität Bonn},

year = 2020,

month = apr,

note = {The traveling salesman problem is the probably most famous problem in combinatorial optimization. Given a graph G and nonnegative edge costs, we want to find a closed walk in G that visits every vertex at least once and has minimum cost. We consider both the symmetric traveling salesman problem (TSP) where G is an undirected graph and the asymmetric traveling salesman problem (ATSP) where G is a directed graph. We also investigate the unit-weight special cases and the more general path versions, where we do not require the walk to be closed, but to start and end in prescribed vertices s and t.

In this thesis we give improved approximation algorithms and better upper bounds on the integrality ratio of the classical linear programming relaxations for several of these traveling salesman problems. For this we use techniques arising from various parts of combinatorial optimization such as linear programming, network flows, ear-decompositions, matroids, and T-joins.

Our results include a (22 + &epsilon)-approximation algorithm for ATSP (for any &epsilon > 0), the first constant upper bound on the integrality ratio for s-t-path ATSP, a new upper bound on the integrality ratio for s-t-path TSP, and a black-box reduction from s-t-path TSP to TSP.},

url = {https://hdl.handle.net/20.500.11811/8310}

}