The parking permit problem

We consider online problems where purchases have time durations which expire regardless of whether the purchase is used or not. The parking permit problem is the natural analog of the well-studied ski rental problem in this model, and we provide matching upper and lower bounds on the competitive ratio for this problem. By extending the techniques thus developed, we give an online-competitive algorithm for the problem of renting steiner forest edges with time durations.

[1]  Tim Roughgarden,et al.  Approximation via cost-sharing: a simple approximation algorithm for the multicommodity rent-or-buy problem , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[2]  Yair Bartal,et al.  On approximating arbitrary metrices by tree metrics , 1998, STOC '98.

[3]  Yossi Azar,et al.  Buy-at-bulk network design , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[4]  Piotr Berman,et al.  On-line algorithms for Steiner tree problems (extended abstract) , 1997, STOC '97.

[5]  Tim Roughgarden,et al.  A constant-factor approximation algorithm for the multicommodity rent-or-buy problem , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

[6]  Yair Bartal,et al.  Probabilistic approximation of metric spaces and its algorithmic applications , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[7]  Kamesh Munagala,et al.  Web caching using access statistics , 2001, SODA '01.

[8]  Rajmohan Rajaraman,et al.  Placement Algorithms for Hierarchical Cooperative Caching , 2001, J. Algorithms.

[9]  Sudipto Guha,et al.  Improved algorithms for the data placement problem , 2002, SODA '02.

[10]  R. Ravi,et al.  Buy-at-bulk network design: approximating the single-sink edge installation problem , 1997, SODA '97.

[11]  A. Meyerson,et al.  Improved Combinatorial Algorithms for Single Sink Edge Installation Problems. , 2000 .

[12]  Noga Alon,et al.  The online set cover problem , 2003, STOC '03.

[13]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[14]  Satish Rao,et al.  A tight bound on approximating arbitrary metrics by tree metrics , 2003, STOC '03.