Towards flexible demands in online leasing problems
From MaRDI portal
Publication:1750358
DOI10.1007/S00453-018-0420-YzbMath1390.68771OpenAlexW2920562146MaRDI QIDQ1750358
Friedhelm Meyer auf der Heide, Christine Markarian, Shouwei Li
Publication date: 18 May 2018
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-018-0420-y
online algorithmsdeadlinesleasinginfrastructure problemsparking permit problemfacility leasingset cover leasing
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Towards the price of leasing online
- 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
- Improved approximation algorithms for capacitated facility location problems
- 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 1.488 Approximation Algorithm for the Uncapacitated Facility Location Problem
- A threshold of ln n for approximating set cover
- Online Primal-Dual Algorithms for Covering and Packing
- Towards Flexible Demands in Online Leasing Problems
- Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP
- Offline and Online Facility Leasing
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Approximation via cost sharing
- The Online Set Cover Problem
- A Greedy Heuristic for the Set-Covering Problem
- The Online Median Problem
- Infrastructure Leasing Problems
- Approximation and Online Algorithms
This page was built for publication: Towards flexible demands in online leasing problems
