Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
A General Approximation Technique for Constrained Forest Problems
SIAM Journal on Computing
Resource-constrained geometric network optimization
Proceedings of the fourteenth annual symposium on Computational geometry
New Approximation Guarantees for Minimum-Weight k-Trees and Prize-Collecting Salesmen
SIAM Journal on Computing
A constant-factor approximation algorithm for the k-MST problem
Journal of Computer and System Sciences
A 2 + ε approximation algorithm for the k-MST problem
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
The vehicle routing problem
A new approximation algorithm for the asymmetric TSP with triangle inequality
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
A 3-approximation for the minimum tree spanning k vertices
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Paths, Trees, and Minimum Latency Tours
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Approximation algorithms for deadline-TSP and vehicle routing with time-windows
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Saving an epsilon: a 2-approximation for the k-MST problem in graphs
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
Journal of the ACM (JACM)
A Recursive Greedy Algorithm for Walks in Directed Graphs
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
The orienteering problem in the plane revisited
Proceedings of the twenty-second annual symposium on Computational geometry
Approximation Algorithms for Orienteering and Discounted-Reward TSP
SIAM Journal on Computing
Poly-logarithmic Approximation Algorithms for Directed Vehicle Routing Problems
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
An O(log n) approximation ratio for the asymmetric traveling salesman path problem
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
The Directed Minimum Latency Problem
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
A Constant Factor Approximation for Minimum λ-Edge-Connected k-Subgraph with Metric Costs
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
A constant-factor approximation for stochastic Steiner forest
Proceedings of the forty-first annual ACM symposium on Theory of computing
Multi-armed Bandits with Metric Switching Costs
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Efficient informative sensing using multiple robots
Journal of Artificial Intelligence Research
Efficient viewpoint assignment for urban texture documentation
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Nonmyopic adaptive informative path planning for multiple robots
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
A Stochastic and Dynamic Vehicle Routing Problem with Time Windows and Customer Impatience
Mobile Networks and Applications
Antourage: mining distance-constrained trips from flickr
Proceedings of the 19th international conference on World wide web
Automatic construction of travel itineraries using social breadcrumbs
Proceedings of the 21st ACM conference on Hypertext and hypermedia
Approximation algorithms for the directed k-tour and k-stroll problems
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Robust sensor placements at informative and communication-efficient locations
ACM Transactions on Sensor Networks (TOSN)
Capacitated vehicle routing with non-uniform speeds
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Approximation algorithms for stochastic orienteering
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Prize-collecting Steiner problems on planar graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
The school bus problem on trees
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Improved algorithms for orienteering and related problems
ACM Transactions on Algorithms (TALG)
Adaptive collective routing using gaussian process dynamic congestion models
Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining
| Hi-index | 0.00 |
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. • A 2 + ε approximation in undirected graphs, improving upon the 3-approximation from [6]. • An O(log2 OPT) approximation in directed graphs. Previously, only a quasi-polynomial time algorithm achieved a poly-logarithmic approximation [14] (a ratio of O (log OPT)). The above results are based on, or lead to, improved algorithms for several other related problems.