Approximation Algorithms for Group Coverage and Vehicle Routing Problems

[1]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[2]  David R. Karger,et al.  Approximation Algorithms for Orienteering and Discounted-Reward TSP , 2007, SIAM J. Comput..

[3]  Satish Rao,et al.  Paths, trees, and minimum latency tours , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[4]  Adam Meyerson,et al.  Approximation algorithms for deadline-TSP and vehicle routing with time-windows , 2004, STOC '04.

[5]  David P. Williamson,et al.  The Design of Approximation Algorithms , 2011 .

[6]  Luca Trevisan,et al.  On Approximation Scheme Preserving Reducability and Its Applications , 1994, FSTTCS.

[7]  Christian Prins,et al.  A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem , 2014, Computational Optimization and Applications.

[8]  Russell Impagliazzo,et al.  On the Complexity of k-SAT , 2001, J. Comput. Syst. Sci..

[9]  Chaitanya Swamy,et al.  Linear-Programming based Approximation Algorithms for Multi-Vehicle Minimum Latency Problems , 2014 .

[10]  Madhu Sudan,et al.  The minimum latency problem , 1994, STOC '94.

[11]  R. Ravi,et al.  The Directed Minimum Latency Problem , 2008, APPROX-RANDOM.

[12]  Aravind Srinivasan,et al.  Distributions on level-sets with applications to approximation algorithms , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[13]  Mohammad R. Salavatipour,et al.  Asymmetric traveling salesman path and directed latency problems , 2009, SODA '10.

[14]  Chandra Chekuri,et al.  Improved algorithms for orienteering and related problems , 2008, SODA '08.

[15]  Jochen Könemann,et al.  The School Bus Problem on Trees , 2011, ISAAC.

[16]  Jan Vondrák,et al.  Maximizing a Monotone Submodular Function Subject to a Matroid Constraint , 2011, SIAM J. Comput..

[17]  René Sitters,et al.  Polynomial time approximation schemes for the traveling repairman and other minimum latency problems , 2013, SODA.

[18]  René Sitters,et al.  The Minimum Latency Problem Is NP-Hard for Weighted Trees , 2002, IPCO.

[19]  Satish Rao,et al.  The k-traveling repairman problem , 2003, SODA '03.

[20]  Maxim Sviridenko,et al.  Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee , 2004, J. Comb. Optim..

[21]  E. Minieka.  The delivery man problem on a tree network , 1990 .

[22]  Chaitanya Swamy,et al.  Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing , 2013, STOC.

[23]  Nicos Christofides.  Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem , 1976, Operations Research Forum.

[24]  David Zuckerman,et al.  Electronic Colloquium on Computational Complexity, Report No. 100 (2005) Linear Degree Extractors and the Inapproximability of MAX CLIQUE and CHROMATIC NUMBER , 2005 .

[25]  Martin Grötschel,et al.  The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

[26]  Sanne Wøhlk,et al.  A branch-and-cut-and-price algorithm for the cumulative capacitated vehicle routing problem , 2014, Eur. J. Oper. Res..

[27]  D. West.  Introduction to Graph Theory , 1995 .

[28]  Narendra Karmarkar,et al.  A new polynomial-time algorithm for linear programming , 1984, Comb..

[29]  Amit Kumar,et al.  Maximum Coverage Problem with Group Budget Constraints and Applications , 2004, APPROX-RANDOM.