Sciweavers

Share
SODA
2008
ACM

Improved algorithms for orienteering and related problems

8 years 3 months ago
Improved algorithms for orienteering and related problems
In this paper we consider the orienteering problem in undirected and directed graphs and obtain improved approximation algorithms. The point to point-orienteering-problem is the following: Given an edge-weighted graph G = (V, E) (directed or undirected), two nodes s, t V and a budget B, find an s-t walk in G of total length at most B that maximizes the number of distinct nodes visited by the walk. This problem is closely related to tour problems such as TSP as well as network design problems such as k-MST. Our main results are the following.
Chandra Chekuri, Nitish Korula, Martin Pál
Added 30 Oct 2010
Updated 30 Oct 2010
Type Conference
Year 2008
Where SODA
Authors Chandra Chekuri, Nitish Korula, Martin Pál
Comments (0)
books