The following pages link to The Online Set Cover Problem (Q3558005):
Displaying 48 items.
- Shrinking maxima, decreasing costs: new online packing and covering problems (Q289907) (← links)
- Towards the price of leasing online (Q346515) (← links)
- Thresholded covering algorithms for robust and max-min optimization (Q403674) (← links)
- Online maximum \(k\)-coverage (Q442204) (← links)
- Frequency capping in online advertising (Q490332) (← links)
- Hitting sets online and unique-MAX coloring (Q741535) (← links)
- The string guessing problem as a method to prove lower bounds on the advice complexity (Q744093) (← links)
- Tight bounds for online weighted tree augmentation (Q832514) (← links)
- Online set multicover algorithms for dynamic D2D communications (Q1679520) (← links)
- The advice complexity of a class of hard online problems (Q1693995) (← links)
- Towards flexible demands in online leasing problems (Q1750358) (← links)
- Online variable sized covering (Q1854485) (← links)
- Online budgeted maximum coverage (Q1979466) (← links)
- Online algorithms for the maximum \(k\)-interval coverage problem (Q2091105) (← links)
- Online unit clustering and unit covering in higher dimensions (Q2134741) (← links)
- Learning to compute the metric dimension of graphs (Q2161840) (← links)
- Online covering with \(\ell_q\)-norm objectives and applications to network design (Q2205975) (← links)
- Network construction with subgraph connectivity constraints (Q2253960) (← links)
- Approximation and heuristic algorithms for computing backbones in asymmetric ad-hoc networks (Q2322692) (← links)
- Improved analysis of the online set cover problem with advice (Q2402263) (← links)
- Online regenerator placement (Q2408557) (← links)
- Online sum-radii clustering (Q2453160) (← links)
- Approximating the online set multicover problems via randomized winnowing (Q2481951) (← links)
- Online maximum \(k\)-interval coverage problem (Q2692231) (← links)
- Online and approximate network construction from bounded connectivity constraints (Q2692731) (← links)
- Randomized Online Algorithms for Set Cover Leasing Problems (Q2942379) (← links)
- (Q2969609) (← links)
- Towards Flexible Demands in Online Leasing Problems (Q3196390) (← links)
- Online Allocation and Pricing with Economies of Scale (Q3460785) (← links)
- Online Buy-at-Bulk Network Design (Q4577806) (← links)
- (Q5002841) (← links)
- (Q5075787) (← links)
- (Q5091070) (← links)
- Tight Bounds for Online Weighted Tree Augmentation (Q5091248) (← links)
- (Q5136326) (← links)
- Approximating Sparse Covering Integer Programs Online (Q5247608) (← links)
- Online Dominating Set (Q5369523) (← links)
- Non-cooperative Cost Sharing Games Via Subsidies (Q5459998) (← links)
- Online Node-weighted Steiner Forest and Extensions via Disk Paintings (Q5737814) (← links)
- Online unit covering in Euclidean space (Q5919348) (← links)
- The Online Broadcast Range-Assignment Problem (Q6065469) (← links)
- The online broadcast range-assignment problem (Q6088305) (← links)
- Online and Approximate Network Construction from Bounded Connectivity Constraints (Q6175211) (← links)
- Online hitting of unit balls and hypercubes in \(\mathbb{R}^d\) using points from \(\mathbb{Z}^d\) (Q6190006) (← links)
- Online hitting set of \(d\)-dimensional fat objects (Q6574940) (← links)
- Online multiset submodular cover (Q6582377) (← links)
- Online class cover problem (Q6600810) (← links)
- Online geometric covering and piercing (Q6614105) (← links)
