The parking permit problem

@article{Meyerson2005ThePP,
  title={The parking permit problem},
  author={Adam Meyerson},
  journal={46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05)},
  year={2005},
  pages={274-282}
}
  • A. Meyerson
  • Published 2005
  • Computer Science
  • 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05)
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. 
On Generalizations of the Parking Permit Problem and Network Leasing Problems
TLDR
This work obtains a 4-approximation algorithm and, for the online setting, a deterministic O(K)-competitive algorithm and a randomized O ( lg ⁡ K ) -competitive algorithm, where K is the number of permit types. Expand
An Algorithm for Online Facility Leasing
TLDR
This work develops and analyzes the first online algorithm for an online facility location problem that has a time-independent competitive factor and proves that it is O (log^2(\ensuremath{l_{\text{max}}}))-competitive for many "natural" cases. Expand
On a Leasing Variant of the Online Connected Facility Location Problem
TLDR
An algorithm is presented that is O(K · lg n)-competitive if the scaling factor is M = 1 and the goal is to use these temporary resources to maintain a dynamic infrastructure that serves n requests while minimizing the total cost. Expand
Competitive Strategies for Online Cloud Resource Allocation with Discounts: The 2-Dimensional Parking Permit Problem
TLDR
This paper initiates the study of cost-effective cloud resource allocation algorithms under price discounts, using a competitive analysis approach, and develops an online algorithm for PPP2 which achieves a deterministic competitive ratio of k (under a certain set of assumptions), where k is the number of resource bundles. Expand
Online Algorithms for Leasing Vertex Cover and Leasing Non-metric Facility Location
TLDR
This work gives the first online algorithms for two classical N P -hard optimization problems, Vertex Cover (VC) and nonmetric Facility Location (non-metric FL), evaluated using the standard notion of competitive analysis. Expand
Connected Facility Leasing Problems
TLDR
This work proposes four variants of the connected facility location problem, and gives approximation and competitive online algorithms for each of them when the (smallest) scale factor is 1. Expand
Offline and Online Facility Leasing
TLDR
This paper considers the online version of the facility leasing problem, in which the clients to be served arrive over time and are not known in advance and gives a deterministic algorithm for the problem that is O(K log n)-competitive. Expand
Group parking permit problems
TLDR
It is proved that the offline version of this problem can be solved in polynomial time, and it is shown how to reduce it to the parking permit problem, while losing a constant cost factor. Expand
Offline and online facility leasing
TLDR
This work modifications an O ( log n ) -competitive algorithm of Fotakis (2007) for the online facility location problem and reanalyzes his algorithm via the dual-fitting technique to prove that it achieves the O (log n ) competitive ratio. Expand
Towards Flexible Demands in Online Leasing Problems
TLDR
A new model for online leasing problems in which a resource can be leased for K different durations each incurring a different cost (longer leases cost less per time unit) is introduced. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 15 REFERENCES
Approximation via cost-sharing: a simple approximation algorithm for the multicommodity rent-or-buy problem
TLDR
This paper gives a conceptually simple 12-approximation algorithm for the multicommodity rent-or-buy problem, and is the first to show the converse - those ideas from cost sharing can be fruitfully applied in the design and analysis of approximation algorithms. Expand
A constant-factor approximation algorithm for the multicommodity rent-or-buy problem
TLDR
This work considers the rent-or-buy problem, a type of multicommodity buy-at-bulk network design in which there are two ways to install capacity on any given edge, and proposes a novel primal-dual algorithm, the first constant factor approximation algorithm for network design with multiple commodities and economies of scale. Expand
Improved Combinatorial Algorithms for Single Sink Edge Installation Problems.
We present the first constant approximation to the single sink buy-at-bulk network design problem, where we have to design a network by buying pipes of different costs and capacities per unit lengthExpand
Buy-at-bulk network design
  • B. Awerbuch, Y. Azar
  • Computer Science
  • Proceedings 38th Annual Symposium on Foundations of Computer Science
  • 1997
TLDR
O(log/sup 2/n) randomized approximation algorithm is provided for the buy-at-bulk network design problem, solving the open problem and solving additional natural variations of the problem, such as multi-sink network design, as well as selective network design. Expand
Improved algorithms for the data placement problem
TLDR
This work studies the data placement problem, where the goal is to place certain data objects in fixed capacity caches in a network to optimize latency of access, and presents a constant approximation, while blowing up the cache capacities by a constant factor. Expand
Buy-at-bulk network design: approximating the single-sink edge installation problem
TLDR
The algorithmic study of an important but NP-hard problem that arises commonly in network design, an undirected graph with one sink node and multiple source nodes, and a small set of cable types, where each cable type is specified by its capacity and its cost per unit length. Expand
Placement Algorithms for Hierarchical Cooperative Caching
TLDR
The main result is a simple constant-factor approximation algorithm for the hierarchical placement problem that admits an efficient distributed implementation and does not appear to be practical for large problem sizes. Expand
On-line algorithms for Steiner tree problems (extended abstract)
TLDR
This work presents an algorithm for the on-line Generalized Steiner Tree (GST) problem, and two other problems: Rectilinear Steiner Arborescence(RSA) and Symmetric Rectil inear Steer arborescence (SRSA), with performance ratios of O(log n). Expand
A tight bound on approximating arbitrary metrics by tree metrics
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This improves upon theExpand
Web caching using access statistics
TLDR
This work considers the problem of caching web pages with the objective of minimizing latency of access, and presents a constant factor approximation to the optimum average latency while exceeding capacity constraints by a logarithmic factor. Expand
...
1
2
...