Infrastructure Leasing Problems

@inproceedings{Anthony2007InfrastructureLP,
  title={Infrastructure Leasing Problems},
  author={Barbara M. Anthony and Anupam Gupta},
  booktitle={IPCO},
  year={2007}
}
Consider the following Steiner Tree leasing problem. Given a graph G= (V,E) with root r, and a sequence of terminal sets D t i¾? Vfor each day ti¾? [T]. A feasible solution to the problem is a set of edges E t for each tconnecting D t to r. Instead of obtaining edges for a single day at a time, or for infinitely long (both of which give Steiner tree problems), we leaseedges for say, { a day, a week, a month, a year}. Naturally, leasing an edge for a longer period costs less per unit of time… 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
A Deterministic Algorithm for Online Steiner Tree Leasing
TLDR
This work studies the Online Steiner Tree Leasing problem, defined in a weighted undirected graph with a distinguished root node r and finds that an edge of length d can be leased using lease type \(\ell \) for cost \(C_\ell \cdot d\) and remains valid for time. 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
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
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
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
Approximation algorithms for the robust facility leasing problem
TLDR
This paper presents a 6-approximation algorithm for the RFLE, which is a variant of the well-known facility leasing problem and alters the phase of constructing an integer primal feasible solution with a careful recognition on the leasing facilities. Expand
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
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
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
...
1
2
3
4
...

References

SHOWING 1-10 OF 40 REFERENCES
On-line generalized Steiner problem
TLDR
A simple randomized algorithm based on on- line generalized Steiner algorithms whose competitive ratio is within a constant factor of the best competitive algorithm for the on-line GSP is provided. Expand
Cost-Sharing Mechanisms for Network Design
TLDR
The algorithm is conceptually simpler than the previous such cost-sharing method due to Pál and Tardos, and improves the previously-known approximation factor of 15 to 4.6. Expand
On Two-Stage Stochastic Minimum Spanning Trees
TLDR
For the two-stage stochastic optimization formulation with finite scenarios, a simple iterative randomized rounding method on a natural LP formulation of the problem yields a nearly best-possible approximation algorithm. Expand
Boosted sampling: approximation algorithms for stochastic optimization
TLDR
This framework is used to derive constant factor approximations for stochastic versions of Vertex Cover, Steiner Tree and Uncapacitated Facility Location for arbitrary distributions π in one fell swoop. Expand
Approximating the Single-Sink Link-Installation Problem in Network Design
TLDR
A new "moat-type" lower bound on the optimal value is introduced and a useful structural property of near-optimal solutions is proved: for every instance of the problem, there is a near-Optimal solution whose graph is acyclic (with a cost no more than twice the optimal cost). Expand
On the Integrality Gap of a Natural Formulation of the Single-Sink Buy-at-Bulk Network Design Problem
TLDR
A natural integer program formulation of the single sink buy-at-bulk network design problem is studied, and it is shown that its integrality gap is O(k), where k is the number of cable types and an O( k)-approximation algorithm is provided. Expand
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
Strengthening integrality gaps for capacitated network design and covering problems
TLDR
The authors show that by adding additional inequalities, the ratio between the optimal integer solution and the optimal solution to the linear program relaxation can be improved significantly, and provide a polynomial-time approximation algorithm to achieve this bound. Expand
New Approaches for Virtual Private Network Design
TLDR
A new randomized approximation algorithm is presented for which, in contrast to earlier approaches from the literature, the resulting solution does not have tree structure and is shown to be a considerable improvement of the previously best known approximation results. Expand
Network design for information networks
TLDR
The Dependent Maybecast Problem extends the Karger-Minkoff maybecast model to probabilities with limited correlation and also contains the 2-stage stochastic optimization problem as a special case and an O(ln n)-approximation algorithm for the Single Sink Information Network Design problem is given. Expand
...
1
2
3
4
...