The Euclidean Orienteering Problem Revisited

DOI10.1137/060667839MaRDI QIDQ3614163zbMATH OpenOpenAlexFDO

Authors Ke Chen, Sariel Har-Peled

Publication date 16 March 2009

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/47a101b2bc5e35d1eba03645e5e005e7b311d43d

zbMATH Keywords

\(k\)-TSPapproximation algorithmsorienteering problemPTAS

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Analysis of algorithms (68W40)

Recommendations

• Faster algorithms for orienteering and \(k\)-TSP
• Improved algorithms for orienteering and related problems
• Approximation algorithms for time-dependent orienteering.
• The capacitated orienteering problem
• scientific article; zbMATH DE number 1839476

Cited in

(11)

• On the Euclidean two paths problem
• The set orienteering problem
• The distance orientation problem
• Faster algorithms for orienteering and \(k\)-TSP
• The capacitated orienteering problem
• Running Errands in Time: Approximation Algorithms for Stochastic Orienteering
• scientific article; zbMATH DE number 7053373 (Why is no real title available?)
• Orienteering with one endomorphism
• Optimizing visibility-based search in polygonal domains
• A survey on approximability of traveling salesman problems using the TSP-T3CO definition scheme
• Approximation schemes for orienteering and deadline TSP in doubling metrics

This page was built for publication: The Euclidean Orienteering Problem Revisited

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