To fill or not to fill: The gas station problem

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4698 LNCS, Issue , 2007, Pages 534-545

  Khuller, Samir ^a   Malekian, Azarakhsh ^a   Mestre, Julián ^a  

^a University of Maryland ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; APPROXIMATION THEORY; MATHEMATICAL MODELS; POLYNOMIALS; ROUTING ALGORITHMS;

GAS STATION PROBLEM; ROUTING PROBLEMS; TANK CAPACITY;

TRAVELING SALESMAN PROBLEM;

EID: 38049005518     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-75520-3_48     Document Type: Conference Paper

References (17)

1. http://www.gasbuddy.com/
2. http://www.aaa.com/
3. Arkin, E.M., Hassin, R., Levin, A.: Approximations for minimum and min-max vehicle routing problems. Journal of Algorithms 59(1), 1-18 (2006)
4. Arkin, E.M., Mitchell, J.S.B., Narasimhan, G.: Resource-constrained geometric network optimization. In: Proceedings of the 14th Annual Symposium on Computational Geometry (SoCG), pp. 307-316 (1998)
5. Awerbuch, B., Azar, Y., Blum, A., Vempala, S.: New approximation guarantees for minimum-weight k-trees and prize-collecting salesmen. SIAM Journal on Computing 28(1), 254-262 (1998)
6. Bansal, N., Blum, A., Chawla, S., Meyerson, A.: Approximation algorithms for deadline-TSP and vehicle routing with time-windows. In: Proceedings of the 36th annual ACM symposium on Theory of computing (STOC), pp. 166-174 (2004)
7. Blum, A., Chawla, S., Karger, D.R., Lane, T., Meyerson, A., Minkoff, M.: Approximation algorithms for orienteering and discounted-reward TSP. In: Proceedings of the 44rd Annual IEEE Symposium on Foundations of Computer Science (FOCS), p. 46 (2003)
8. Cormen, T.H., Leiserson, CE., Rivest, R.L., Stein, C.: Introduction to Algorithms. M.I.T. Press and McGraw-Hill (2001)
9. Frederickson, G.N., Hecht, M.S., Kim, C.E.: Approximation algorithms for some routing problems. SIAM Journal on Computing 7(2), 178-193 (1978)
10. Golden, B.L., Levy, L., Vohra, R.: The orienteering problem. Naval Research Logistics 34, 307-318 (1987)
11. Lawler, E.L.: Combinatorial Optimization: Networks and Matroids. Dover Publications, Mineola, NY (2001)
12. Lawler, E.L., Lenstra, J.K., Kan, A.H.G.R., Shmoys, D.B.: The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. John Wiley & Sons, Chichester (1985)
13. Li, C.-L., Simchi-Levi, D., Desrochers, M.: On the distance constrained vehicle routing problem. Operations Research 40(4), 790-799 (1992)
14. Haimovich, A.G.R.K.M.: Bounds and heuristics for capacitated routing problems. Mathematics of Operations Research 10(4), 527-542 (1985)
15. Haimovich, L.S.M., Rinnoooy Kan, A.G.: Analysis of heuristics for vehicle routing problems. Vehicle Routing: Methods and Studies, pp. 47-61 (1988)
16. Nagarajan, V., Ravi, R.: Minimum vehicle routing with a common deadline. In: Díaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX 2006 and RANDOM 2006. LNCS, vol. 4110, pp. 212-223. Springer, Heidelberg (2006)
17. Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization. Dover Publications, Inc, Mineola, NY (1998)