The following pages link to The Online Set Cover Problem (Q3558005):
Displaying 22 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 budgeted maximum coverage (Q1979466) (← 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)
- 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)
