Exact algorithms for the minimum latency problem
Information Processing Letters
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
Approximating the k-traveling repairman problem with repairtimes
Journal of Discrete Algorithms
The k-traveling repairmen problem
ACM Transactions on Algorithms (TALG)
Improved algorithms for orienteering and related problems
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
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
Multi-robot routing with linear decreasing rewards over time
ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
Exact algorithms for the minimum latency problem
Information Processing Letters
ACM Transactions on Algorithms (TALG)
An effective memetic algorithm for the cumulative capacitated vehicle routing problem
Computers and Operations Research
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Improved genetic algorithm for minimum latency problem
Proceedings of the 2010 Symposium on Information and Communication Technology
Asymmetric traveling salesman path and directed latency problems
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Improved approximation algorithms for the minimum latency problem via prize-collecting strolls
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Approximation algorithms for optimal decision trees and adaptive TSP problems
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
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
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
Improved approximation algorithms for the min-max tree cover and bounded tree cover problems
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Improved Approximation Algorithms for Prize-Collecting Steiner Tree and TSP
SIAM Journal on Computing
Prize-collecting Steiner problems on planar graphs
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Online k-server routing problems
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Improving christofides' algorithm for the s-t path TSP
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Improved algorithms for orienteering and related problems
ACM Transactions on Algorithms (TALG)
Approximation algorithms for maximum latency and partial cycle cover
Discrete Optimization
The Delivery Man Problem with time windows
Discrete Optimization
Minimum latency submodular cover
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Physical search problems with probabilistic knowledge
Artificial Intelligence
| Hi-index | 0.00 |
We give improved approximation algorithms for a variety of latency minimization problems. In particular, we give a 3.591-approximation to the minimum latency problem, improving on previous algorithms by a multiplicative factor of 2. Our techniques also give similar improvements for related problems like k-traveling repairmen and its multiple depot variant. We also observe that standard techniques can be used to speed up the previous and this algorithm by a factor of \bar O(n).