Pages that link to "Item:Q3188864"
From MaRDI portal
The following pages link to On the max min vertex cover Problem (Q3188864):
Displaying 10 items.
- The many facets of upper domination (Q1704853) (← links)
- Parameterized (in)approximability of subset problems (Q1785218) (← links)
- On the Complexity Landscape of the Domination Chain (Q2795935) (← links)
- Upper Domination: Complexity and Approximation (Q2819508) (← links)
- Maximum Minimal Vertex Cover Parameterized by Vertex Cover (Q2946427) (← links)
- The Probabilistic Minimum Vertex-covering Problem (Q4532541) (← links)
- Algorithms - ESA 2003 (Q5897254) (← links)
- Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation (Q5925558) (← links)
- Upper dominating set: tight algorithms for pathwidth and sub-exponential approximation (Q5925677) (← links)
- Matroid-constrained vertex cover (Q6162073) (← links)