Pages that link to "Item:Q1945696"
From MaRDI portal
The following pages link to A 6/5-approximation algorithm for the maximum 3-cover problem (Q1945696):
Displaying 5 items.
- Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3 (Q1018104) (← links)
- Generalized budgeted submodular set function maximization (Q2051778) (← links)
- The multi-budget maximum weighted coverage problem (Q2692723) (← links)
- A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem (Q3599128) (← links)
- Generalized budgeted submodular set function maximization (Q5005131) (← links)