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 31 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)
- Robust multicovers with budgeted uncertainty (Q1755380) (← links)
- Approximation algorithm for the partial set multi-cover problem (Q2010112) (← links)
- Tight approximation bounds for maximum multi-coverage (Q2118140) (← links)
- Approximation of set multi-cover via hypergraph matching (Q2207501) (← links)
- Parallel approximation for partial set cover (Q2243336) (← links)
- A bicriteria algorithm for the minimum submodular cost partial set multi-cover problem (Q2282997) (← links)
- Set cover problems with small neighborhood covers (Q2322696) (← links)
- An anonymous self-stabilizing algorithm for 1-maximal independent set in trees (Q2390286) (← links)
- Approximating set multi-covers (Q2408974) (← 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)
- Novel geometric approach for virtual coiling (Q2636492) (← links)
- A parallel randomized approximation algorithm for non-preemptive single machine scheduling with release dates and delivery times (Q2668670) (← links)
- Parallel algorithms for minimum general partial dominating set and maximum budgeted dominating set in unit disk graph (Q2674709) (← links)
- Approximation algorithm for partial set multicover versus full set multicover (Q4634530) (← links)
- Breaking the<i>r</i><sub>max</sub>Barrier: Enhanced Approximation Algorithms for Partial Set Multicover Problem (Q4995101) (← links)
- Distributed Spanner Approximation (Q4997324) (← links)
- Tight Approximation Bounds for Maximum Multi-coverage (Q5041735) (← links)
- An Optimal Approximation for Submodular Maximization Under a Matroid Constraint in the Adaptive Complexity Model (Q5058055) (← links)
- Inapproximability of $H$-Transversal/Packing (Q5348212) (← links)
- On the Approximability of Combinatorial Exchange Problems (Q5459974) (← links)
- Constant-time distributed dominating set approximation (Q5917933) (← links)
- Set selection under explorable stochastic uncertainty via covering techniques (Q6086011) (← links)
- On improved interval cover mechanisms for crowdsourcing markets (Q6164503) (← links)