Towards the price of leasing online
type: Item
instance of: scholarly article
title: Towards the price of leasing online
zbMATH Open document ID: 1356.90114
author: Sebastian Abshoff
author: Peter Kling
author: Christine Markarian
author: Peter Pietrzyk
author: Friedhelm Meyer auf der Heide
published in: Journal of Combinatorial Optimization
publication date: 2016-11-29T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B80
zbMATH DE Number: 6657322
zbMATH Keywords: online algorithms
zbMATH Keywords: set cover problems
zbMATH Keywords: facility location problems
zbMATH Keywords: primal dual algorithms
zbMATH Keywords: randomized rounding
MaRDI profile type: Publication
full work available at URL: s10878-015-9915-5
OpenAlex ID: W2211969678
cites work: Randomized Online Algorithms for Set Cover Leasing Problems
cites work: Admission control to minimize rejections and online set cover with repetitions
cites work: A general approach to online network optimization problems
cites work: Algorithmic construction of sets for k -restrictions
cites work: The Online Set Cover Problem
cites work: Infrastructure Leasing Problems
cites work: A Greedy Heuristic for the Set-Covering Problem
cites work: Approximating the online set multicover problems via randomized winnowing
cites work: Randomized approximation algorithms for set multicover problems with applications to reverse engineering of protein and gene networks
cites work: Online Primal-Dual Algorithms for Covering and Packing
cites work: A threshold of ln n for approximating set cover
cites work: A primal-dual algorithm for online non-uniform facility location
cites work: On the competitive ratio for online facility location
cites work: Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
cites work: Approximation algorithms for combinatorial problems
cites work: On the ratio of optimal integral and fractional covers
cites work: Offline and Online Facility Leasing
cites work: Rapid randomized pruning for fast greedy distributed algorithms
cites work: Q4782696
DOI: 10.1007/S10878-015-9915-5
description: scientific article; zbMATH DE number 6657322