Improved Approximations for TSP with Simple Precedence Constraints

DOI10.1007/978-3-642-13073-1_7zbMath1284.68655OpenAlexW2143320599MaRDI QIDQ3562992

Tobias Mömke, Monika Steinová, Ralf Klasing, Hans-Joachim Böckenhauer

Publication date: 28 May 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13073-1_7

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items (3)

Improved Approximations for Hard Optimization Problems via Problem Instance Classification ⋮ Structural Properties of Hard Metric TSP Inputs ⋮ Improved approximations for ordered TSP on near-metric graphs

This page was built for publication: Improved Approximations for TSP with Simple Precedence Constraints