Approximation algorithms for the directed k-tour and k-stroll problems

DOI10.1007/978-3-642-15369-3_3MaRDI QIDQ3588397zbMATHOpenAlexFDO

Authors 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)

Recommendations

• Approximation algorithms for the directed \(k\)-Tour and \(k\)-Stroll problems
• The directed orienteering problem
• Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems
• An O(logn) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem
• Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs

Cited in

(4)

• Approximating corridors and tours via restriction and relaxation techniques
• Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems
• The directed orienteering problem
• Approximation algorithms for the directed \(k\)-Tour and \(k\)-Stroll problems

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)