The online set cover problem
From MaRDI portal
Publication:3558005
DOI10.1137/060661946zbMATH Open1200.68271OpenAlexW2074121653MaRDI QIDQ3558005FDOQ3558005
Authors: Noga Alon, Baruch Awerbuch, Niv Buchbinder, Joseph (Seffi) Naor, Yossi Azar 
Publication date: 29 April 2010
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/060661946
Recommendations
Online algorithms; streaming algorithms (68W27) Randomized algorithms (68W20) Analysis of algorithms (68W40) Nonnumerical algorithms (68W05)
Cited In (62)
- Randomized online algorithms for set cover leasing problems
- Approximation and heuristic algorithms for computing backbones in asymmetric ad-hoc networks
- Online variable sized covering
- Online Node-weighted Steiner Forest and Extensions via Disk Paintings
- The online set cover problem
- Tight bounds for online weighted tree augmentation
- Tight bounds for online weighted tree augmentation
- Title not available (Why is that?)
- The advice complexity of a class of hard online problems
- Approximating the online set multicover problems via randomized winnowing
- Efficient on-line algorithm for maintaining \(k\)-cover of sparse bit-strings
- Approximating sparse covering integer programs online
- Online unit clustering and unit covering in higher dimensions
- Online Buy-at-Bulk Network Design
- Online and dynamic algorithms for set cover
- Towards flexible demands in online leasing problems
- Shrinking maxima, decreasing costs: new online packing and covering problems
- Greedy algorithms for online survivable network design
- Thresholded covering algorithms for robust and max-min optimization
- Online maximum \(k\)-coverage
- On the advice complexity of the set cover problem
- Network construction with subgraph connectivity constraints
- Online Dominating Set
- Online and Approximate Network Construction from Bounded Connectivity Constraints
- Hitting sets online and unique-MAX coloring
- Online sum-radii clustering
- Learning to compute the metric dimension of graphs
- Improved analysis of the online set cover problem with advice
- Algorithms – ESA 2005
- Online set packing
- Towards Flexible Demands in Online Leasing Problems
- Online unit covering in Euclidean space
- Towards the price of leasing online
- Online set multicover algorithms for dynamic D2D communications
- The covert set-cover problem with application to network discovery
- Online allocation and pricing with economies of scale
- Online algorithms for the maximum \(k\)-interval coverage problem
- Frequency capping in online advertising
- The online set aggregation problem
- Network construction with ordered constraints
- Online and approximate network construction from bounded connectivity constraints
- The string guessing problem as a method to prove lower bounds on the advice complexity
- Online maximum \(k\)-interval coverage problem
- Database Theory - ICDT 2005
- Algorithms and Data Structures
- Title not available (Why is that?)
- Online regenerator placement
- Greedy algorithms for on-line set-covering
- Online covering with \(\ell_q\)-norm objectives and applications to network design
- Title not available (Why is that?)
- Online budgeted maximum coverage
- Online budgeted maximum coverage
- Non-cooperative Cost Sharing Games Via Subsidies
- Competitive analysis via regularization
- Online hitting set of \(d\)-dimensional fat objects
- Online multiset submodular cover
- Hitting geometric objects online via points in \(\mathbb{Z}^d\)
- Online class cover problem
- The Online Broadcast Range-Assignment Problem
- Online geometric covering and piercing
- Online hitting of unit balls and hypercubes in \(\mathbb{R}^d\) using points from \(\mathbb{Z}^d\)
- The online broadcast range-assignment problem
This page was built for publication: The online set cover problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3558005)
