Randomized Online Algorithms for Set Cover Leasing Problems

DOI10.1007/978-3-319-12691-3_3zbMath1431.68158OpenAlexW2120620MaRDI QIDQ2942379

Christine Markarian, Friedhelm Meyer auf der Heide, Sebastian Abshoff

Publication date: 11 September 2015

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-12691-3_3

zbMATH Keywords

online algorithmsrandomized algorithmsleasingset covermulticover

Mathematics Subject Classification ID

Stochastic programming (90C15) Combinatorial optimization (90C27) Extremal set theory (05D05) Online algorithms; streaming algorithms (68W27)

Related Items (5)

Cost-efficient scheduling on machines from the cloud ⋮ Towards the price of leasing online ⋮ Towards Flexible Demands in Online Leasing Problems ⋮ Unnamed Item ⋮ Towards flexible demands in online leasing problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• Approximating the online set multicover problems via randomized winnowing
• Algorithmic construction of sets for k -restrictions
• A threshold of ln n for approximating set cover
• Offline and Online Facility Leasing
• The Online Set Cover Problem
• A Greedy Heuristic for the Set-Covering Problem
• Infrastructure Leasing Problems
• Algorithms – ESA 2005

This page was built for publication: Randomized Online Algorithms for Set Cover Leasing Problems