The parking permit problem

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS

Volumn 2005, Issue , 2005, Pages 274-282

  Meyerson, Adam ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ONLINE COMPETITIVE ALGORITHMS; PARKING PERMIT PROBLEMS;

ALGORITHMS; ANALOG COMPUTERS; COMPUTER SCIENCE; MATHEMATICAL MODELS; PURCHASING;

ONLINE SYSTEMS;

EID: 33748607167     PISSN: 02725428     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SFCS.2005.72     Document Type: Conference Paper

References (14)

1. N. Alon, B. Awerbuch, Y. Azar, N. Buchbinder, and J. Naor. The online set cover problem. ACM Symposium on Theory of Computing, 2003.
2. B. Awerbuch and Y. Azar. Buy-at-bulk network design. IEEE Symposium on Foundations of Computer Science, 1997.
3. Y. Bartal. Probabilistic approximation of metric spaces and its algorithmic applications. IEEE Symposium on Foundations of Computer Science, 1996.
4. Y. Bartal. On approximating arbitrary metrics by tree metrics. ACM Symposium on Theory of Computing, 1998.
5. P. Berman and C. Coulston. On-line algorithms for steiner tree problems. ACM Symposium on Theory of Computing, 1997.
6. A. Borodin and R. El-Yaniv. Online Computation and Competitive Analysis. Cambridge University Press, 1996.
7. J. Fakcharoenphol, S. Rao, and K. Talwar. A tight bound on approximating arbitrary metrics by tree metrics. ACM Symposium on Theory of Computing, 2003.
8. S. Guha, A. Meyerson, and K. Munagala. Improved combinatorial algorithms for single sink edge installation problems. ACM Symposium on Theory of Computing, 2001.
9. S. Guha and K. Munagala. Improved algorithms for the data placement problem. ACM Symposium on Discrete Algorithms, 2002.
10. A. Gupta, A. Kumar, M. Pal, and T. Roughgarden. Approximation via cost-sharing: a simple approximation algorithm for the multicommodity rent-or-buy problem. IEEE Symposium on Foundations of Computer Science, 2003.
11. M. Korupolu, G. Plaxton, and R. Rajaraman. Placement algorithms for hierarchical cooperative caching. ACM Symposium on Discrete Algorithms, 1999.
12. A. Kumar, A. Gupta, and T. Roughgarden. A constant-factor approximation algorithm for the multi-commodity rent-or-buy problem. IEEE Symposium on Foundations of Computer Science, 2002.
13. A. Meyerson, K. Munagala, and S. Plotkin. Web caching using access statistics. ACM Symposium on Discrete Algorithms, 2001.
14. F. Salman, J. Cheriyan, R. Ravi, and S. Subramanian. Buy-at-bulk network design: approximating the single-sink edge installation problem. ACM Symposium on Discrete Algorithms, 1997.