Towards the price of leasing online
From MaRDI portal
Publication:346515
DOI10.1007/S10878-015-9915-5zbMath1356.90114OpenAlexW2211969678MaRDI QIDQ346515
Christine Markarian, Peter Kling, Sebastian Abshoff, Peter Pietrzyk, Friedhelm Meyer auf der Heide
Publication date: 29 November 2016
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-015-9915-5
online algorithmsrandomized roundingfacility location problemsprimal dual algorithmsset cover problems
Related Items (5)
Unnamed Item ⋮ Group parking permit problems ⋮ Unnamed Item ⋮ Towards flexible demands in online leasing problems ⋮ Leasing with Uncertainty
Cites Work
- Unnamed Item
- Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks
- A primal-dual algorithm for online non-uniform facility location
- Approximation algorithms for combinatorial problems
- On the ratio of optimal integral and fractional covers
- On the competitive ratio for online facility location
- Approximating the online set multicover problems via randomized winnowing
- Admission control to minimize rejections and online set cover with repetitions
- Randomized Online Algorithms for Set Cover Leasing Problems
- Algorithmic construction of sets for k -restrictions
- A general approach to online network optimization problems
- A threshold of ln n for approximating set cover
- Online Primal-Dual Algorithms for Covering and Packing
- Offline and Online Facility Leasing
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- The Online Set Cover Problem
- A Greedy Heuristic for the Set-Covering Problem
- Rapid randomized pruning for fast greedy distributed algorithms
- Infrastructure Leasing Problems
This page was built for publication: Towards the price of leasing online
