Approximation Algorithms for the Directed k-Tour and k-Stroll Problems

DOI10.1007/978-3-642-15369-3_3zbMATH Open1304.68207OpenAlexW1607186617MaRDI QIDQ3588397FDOQ3588397

MohammadHossein Bateni, Julia Chuzhoy

Publication date: 10 September 2010

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-15369-3_3

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25)

Cited In (3)

• Approximating corridors and tours via restriction and relaxation techniques
• An Improved Integrality Gap for Asymmetric TSP Paths
• The directed orienteering problem

This page was built for publication: Approximation Algorithms for the Directed k-Tour and k-Stroll Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3588397)