Improved algorithms for orienteering and related problems
From MaRDI portal
Publication:3189064
DOI10.1145/2229163.2229167zbMath1295.05225OpenAlexW2622090745MaRDI QIDQ3189064
Chandra Chekuri, Nitish Korula, Martin Pál
Publication date: 9 September 2014
Published in: ACM Transactions on Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/2229163.2229167
Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Signed and weighted graphs (05C22)
Related Items (20)
Faster algorithms for orienteering and \(k\)-TSP ⋮ Combinatorial algorithms for rooted prize-collecting walks and applications to orienteering and minimum-latency problems ⋮ Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Directed Network Design Problems ⋮ Maximum coverage problem with group budget constraints ⋮ Orienteering for electioneering ⋮ On the adaptivity gap of stochastic orienteering ⋮ Budgeted Prize-Collecting Traveling Salesman and Minimum Spanning Tree Problems ⋮ Dynamic Traveling Repair Problem with an Arbitrary Time Window ⋮ Discounted reward TSP ⋮ Complexity and approximation for traveling salesman problems with profits ⋮ Approximation algorithms for the arc orienteering problem ⋮ Minisum and maximin aerial surveillance over disjoint rectangles ⋮ Deadline TSP ⋮ Capacitated Vehicle Routing with Nonuniform Speeds ⋮ An approximation algorithm for vehicle routing with compatibility constraints ⋮ New approximation algorithms for the rooted budgeted cycle cover problem ⋮ New approximation algorithms for the rooted budgeted cycle cover problem ⋮ Unnamed Item ⋮ Running Errands in Time: Approximation Algorithms for Stochastic Orienteering ⋮ Prize-Collecting TSP with a Budget Constraint
This page was built for publication: Improved algorithms for orienteering and related problems
