Pages that link to "Item:Q2956881"
From MaRDI portal
The following pages link to Parameterized exact and approximation algorithms for maximum<i>k</i>-set cover and related satisfiability problems (Q2956881):
Displaying 5 items.
- Representative families for matroid intersections, with applications to location, packing, and covering problems (Q2028091) (← links)
- Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting (Q2304553) (← links)
- Voting on multi-issue domains with conditionally lexicographic preferences (Q2315365) (← links)
- Parameterised temporal exploration problems (Q2698289) (← links)
- FPT-Algorithms for the \(\ell\) -Matchoid Problem with a Coverage Objective (Q6100609) (← links)
