Pages that link to "Item:Q5945918"
From MaRDI portal
The following pages link to Polynomial time approximation schemes for some dense instances of NP-hard optimization problems (Q5945918):
Displaying 9 items.
- Approximating vertex cover in dense hypergraphs (Q450531) (← links)
- Nearly tight approximation bounds for vertex cover on dense \(k\)-uniform \( k\)-partite hypergraphs (Q491613) (← links)
- Approximating edge dominating set in dense graphs (Q764308) (← links)
- Connected vertex covers in dense graphs (Q974753) (← links)
- Polynomial approximation algorithms with performance guarantees: an introduction-by-example (Q1771343) (← links)
- Hardness of fully dense problems (Q2643075) (← links)
- Approximating Subdense Instances of Covering Problems (Q2840726) (← links)
- Approximating Edge Dominating Set in Dense Graphs (Q3010383) (← links)
- Connected Vertex Covers in Dense Graphs (Q3541785) (← links)
