# Compact, Provably-Good LPs for Orienteering and Regret-Bounded Vehicle Routing

@article{Friggstad2017CompactPL, title={Compact, Provably-Good LPs for Orienteering and Regret-Bounded Vehicle Routing}, author={Zachary Friggstad and C. Swamy}, journal={ArXiv}, year={2017}, volume={abs/1708.01335} }

We develop polynomial-size LP-relaxations for orienteering and the regret-bounded vehicle routing problem (\(\mathsf {RVRP}\)) and devise suitable LP-rounding algorithms that lead to various new insights and approximation results for these problems. In orienteering, the goal is to find a maximum-reward r-rooted path, possibly ending at a specified node, of length at most some given budget B. In \(\mathsf {RVRP}\), the goal is to find the minimum number of r-rooted paths of regret at most a… CONTINUE READING

#### Figures and Topics from this paper

#### Figures

5 Citations

A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time

- Mathematics, Computer Science
- ESA
- 2020

- PDF

Improving the Approximation Ratio for Capacitated Vehicle Routing

- Computer Science
- ArXiv
- 2020

Highly Influenced- PDF

UAV Trajectory Optimization for Time Constrained Applications

- Computer Science, Mathematics
- IEEE Networking Letters
- 2020

1- PDF

#### References

SHOWING 1-10 OF 26 REFERENCES

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

- Mathematics, Computer Science
- STOC
- 2014

21- PDF

Approximation Algorithms for Orienteering and Discounted-Reward TSP

- Computer Science, Mathematics
- SIAM J. Comput.
- 2007

58- PDF

An Improved Integrality Gap for Asymmetric TSP Paths

- Computer Science, Mathematics
- Math. Oper. Res.
- 2016

4

Linear Programming-based Approximation Algorithms for Multi-Vehicle Minimum Latency Problems (Extended Abstract)

- Computer Science
- SODA
- 2015

4- PDF

Approximation algorithms for orienteering and discounted-reward TSP

- Mathematics, Computer Science
- 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.
- 2003

217- PDF

The finite capacity dial-a-ride problem

- Computer Science, Mathematics
- Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)
- 1998

62

Effective-Resistance-Reducing Flows, Spectrally Thin Trees, and Asymmetric TSP

- Mathematics, Computer Science
- 2015 IEEE 56th Annual Symposium on Foundations of Computer Science
- 2015

44- PDF

Improved algorithms for orienteering and related problems

- Mathematics, Computer Science
- SODA '08
- 2008

167 Highly Influential- PDF

Bounds and Heuristics for Capacitated Routing Problems

- Mathematics, Computer Science
- Math. Oper. Res.
- 1985

313