Pages that link to "Item:Q489714"
From MaRDI portal
The following pages link to Efficient algorithms for the \textsc{max~\(k\)-vertex cover problem} (Q489714):
Displaying 4 items.
- FPT approximation schemes for maximizing submodular functions (Q1680508) (← links)
- Voting on multi-issue domains with conditionally lexicographic preferences (Q2315365) (← links)
- Super-polynomial approximation branching algorithms (Q2954364) (← links)
- Parameterized exact and approximation algorithms for maximum<i>k</i>-set cover and related satisfiability problems (Q2956881) (← links)
