The following pages link to The online set cover problem (Q3581267):
Displaying 11 items.
- Online maximum \(k\)-coverage (Q442204) (← links)
- Non-cooperative cost sharing games via subsidies (Q987398) (← links)
- Robust multicovers with budgeted uncertainty (Q1755380) (← links)
- Online variable sized covering (Q1854485) (← links)
- Viral marketing of online game by DS decomposition in social networks (Q2282998) (← links)
- Approximating the online set multicover problems via randomized winnowing (Q2481951) (← links)
- (Q2969609) (← links)
- Pick, pack, \& survive: charging robots in a modern warehouse based on online connected dominating sets (Q3301010) (← links)
- Online Dominating Set (Q5369523) (← links)
- Adversarial bandits with knapsacks (Q6551256) (← links)
- Chasing convex bodies optimally (Q6608553) (← links)