Pages that link to "Item:Q2025081"
From MaRDI portal
The following pages link to Approximation algorithm for the multicovering problem (Q2025081):
Displaying 9 items.
- Randomized approximation for the set multicover problem in hypergraphs (Q262245) (← links)
- Randomized approximation of bounded multicovering problems (Q679446) (← links)
- One for the price of two: a unified approach for approximating covering problems (Q1977131) (← links)
- Approximation of set multi-cover via hypergraph matching (Q2207501) (← links)
- Approximating set multi-covers (Q2408974) (← links)
- A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem (Q3599128) (← links)
- Approximation Algorithms for Edge-Covering Problem (Q3628568) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313045) (← links)
- Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems (Q6593834) (← links)