The Euclidean Orienteering Problem Revisited

DOI10.1137/060667839zbMath1165.68033OpenAlexW2037666581MaRDI QIDQ3614163

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

approximation algorithmsPTASorienteering problem\(k\)-TSP

Mathematics Subject Classification ID

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

Related Items (4)

Faster algorithms for orienteering and \(k\)-TSP ⋮ The capacitated orienteering problem ⋮ Running Errands in Time: Approximation Algorithms for Stochastic Orienteering ⋮ Unnamed Item

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