Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing

DOI10.1145/2591796.2591840zbMath1315.90005arXiv1311.6024OpenAlexW1999372743MaRDI QIDQ5259610

Chaitanya Swamy, Zachary Friggstad

Publication date: 26 June 2015

Published in: Proceedings of the forty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1311.6024

zbMATH Keywords

vehicle routingapproximation algorithmsLP roundingconfiguration LPsdistance-constrained vehicle routing

Mathematics Subject Classification ID

Linear programming (90C05) Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20) Approximation algorithms (68W25)

Related Items (15)

A constant-factor approximation for directed latency in quasi-polynomial time ⋮ Distance constrained vehicle routing problem to minimize the total cost: algorithms and complexity ⋮ Improved approximation algorithms for some min-max and minimum cycle cover problems ⋮ Improved Approximation Algorithms for Min-Max and Minimum Vehicle Routing Problems ⋮ Combinatorial algorithms for rooted prize-collecting walks and applications to orienteering and minimum-latency problems ⋮ Approximation and polynomial algorithms for the data mule scheduling with handling time and time span constraints ⋮ Solving Zero-Sum Games Using Best-Response Oracles with Applications to Search Games ⋮ A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time ⋮ The capacitated orienteering problem ⋮ New approximation algorithms for the minimum cycle cover problem ⋮ Vehicle routing with subtours ⋮ Minimizing latency of capacitated \(k\)-tours ⋮ New LP relaxations for minimum cycle/path/tree cover problems ⋮ Improving the approximation ratio for capacitated vehicle routing ⋮ Improving the approximation ratio for capacitated vehicle routing

Uses Software

• SuLQ

Cites Work

• Unnamed Item
• Unnamed Item
• Efficient algorithms for privately releasing marginals via convex relaxations
• The Geometry of Differential Privacy: The Small Database and Approximate Cases
• Faster Algorithms for Privately Releasing Marginals
• Private Learning and Sanitization: Pure vs. Approximate Differential Privacy
• Privately Releasing Conjunctions and the Statistical Query Barrier
• On the geometry of differential privacy
• Interactive privacy via the median mechanism
• The price of privately releasing contingency tables and the spectra of random matrices with correlated rows
• Lower Bounds in Differential Privacy
• Iterative Constructions and Private Data Release
• Characterizing the sample complexity of private learners
• Faster private release of marginals on small databases
• Bounds on the Sample Complexity for Private Learning and Private Data Release
• Differential Privacy and the Fat-Shattering Dimension of Linear Queries
• Our Data, Ourselves: Privacy Via Distributed Noise Generation
• New Efficient Attacks on Statistical Disclosure Control Mechanisms
• Collusion-secure fingerprinting for digital data
• On the complexity of differentially private data release
• Advances in Cryptology – CRYPTO 2004
• Answering n _{2+o(1)} counting queries with differential privacy is hard
• Theory of Cryptography

This page was built for publication: Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing