Pages that link to "Item:Q2583713"
From MaRDI portal
The following pages link to Improved approximation of maximum vertex cover (Q2583713):
Displaying 10 items.
- Purely combinatorial approximation algorithms for maximum \(k\)-vertex cover in bipartite graphs (Q1662108) (← links)
- On approximation of max-vertex-cover (Q1848386) (← links)
- Analysis of an approximate greedy algorithm for the maximum edge clique partitioning problem (Q1926502) (← links)
- Improved non-approximability results for minimum vertex cover with density constraints (Q1960657) (← links)
- The maximum vertex coverage problem on bipartite graphs (Q2448919) (← links)
- An improved approximation algorithm for vertex cover with hard capacities (Q2581755) (← links)
- Vertex cover: Further observations and further improvements (Q2775891) (← links)
- (Q3455032) (← links)
- Combinatorial approximation of maximum <i>k</i>-vertex cover in bipartite graphs within ratio 0.7 (Q4579900) (← links)
- Automata, Languages and Programming (Q5716851) (← links)