Abstract
In this paper we study several routing problems that generalize shortest paths and the Traveling Salesman Problem. We consider a more general model that incorporates the actual cost in terms of gas prices. We have a vehicle with a given tank capacity. We assume that at each vertex gas may be purchased at a certain price. The objective is to find the cheapest route to go from s to t, or the cheapest tour visiting a given set of locations. Surprisingly, the problem of find the cheapest way to go from s to t can be solved in polynomial time and is not NP-complete. For most other versions however, the problem is NP-complete and we develop polynomial time approximation algorithms for these versions. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Khuller, S., Malekian, A., & Mestre, J. (2007). To fill or not to fill: The gas station problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4698 LNCS, pp. 534–545). Springer Verlag. https://doi.org/10.1007/978-3-540-75520-3_48
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
