Pages that link to "Item:Q4210164"
From MaRDI portal
The following pages link to Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs (Q4210164):
Displayed 12 items.
- A self-stabilizing algorithm to maximal 2-packing with improved complexity (Q436592) (← links)
- On positive influence dominating sets in social networks (Q621845) (← links)
- Approximation schemes for deal splitting and covering integer programs with multiplicity constraints (Q655417) (← links)
- Beyond Moulin mechanisms (Q834858) (← links)
- Set multi-covering via inclusion-exclusion (Q837180) (← links)
- A derandomization using min-wise independent permutations (Q876688) (← links)
- Dynamic programming based algorithms for set multicover and multiset multicover problems (Q974740) (← links)
- An anonymous self-stabilizing algorithm for 1-maximal independent set in trees (Q2390286) (← links)
- Scheduling orders for multiple product types with due date related objectives (Q2569034) (← links)
- Fast distributed algorithms for (weakly) connected dominating sets and linear-size skeletons (Q2575833) (← links)
- On the Approximability of Combinatorial Exchange Problems (Q5459974) (← links)
- Constant-time distributed dominating set approximation (Q5917933) (← links)
