The Online Set Cover Problem

Cited In (49)

Online geometric covering and piercing
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
Online Allocation and Pricing with Economies of Scale
Tight bounds for online weighted tree augmentation
Title not available (Why is that?)
The advice complexity of a class of hard online problems
Online hitting set of \(d\)-dimensional fat objects
Approximating the online set multicover problems via randomized winnowing
Online multiset submodular cover
Online unit clustering and unit covering in higher dimensions
Online Buy-at-Bulk Network Design
Randomized Online Algorithms for Set Cover Leasing Problems
Towards flexible demands in online leasing problems
Shrinking maxima, decreasing costs: new online packing and covering problems
Thresholded covering algorithms for robust and max-min optimization
Hitting geometric objects online via points in \(\mathbb{Z}^d\)
Online class cover problem
Online maximum \(k\)-coverage
Network construction with subgraph connectivity constraints
Title not available (Why is that?)
Online Dominating Set
Online and Approximate Network Construction from Bounded Connectivity Constraints
The Online Broadcast Range-Assignment Problem
Hitting sets online and unique-MAX coloring
Approximating Sparse Covering Integer Programs Online
Online hitting of unit balls and hypercubes in \(\mathbb{R}^d\) using points from \(\mathbb{Z}^d\)
Online sum-radii clustering
Learning to compute the metric dimension of graphs
Improved analysis of the online set cover problem with advice
The online broadcast range-assignment problem
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
Online algorithms for the maximum \(k\)-interval coverage problem
Frequency capping in online advertising
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
Tight Bounds for Online Weighted Tree Augmentation
Title not available (Why is that?)
Online regenerator placement
Title not available (Why is that?)
Online covering with \(\ell_q\)-norm objectives and applications to network design
Title not available (Why is that?)
Online budgeted maximum coverage
Non-cooperative Cost Sharing Games Via Subsidies

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)