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 17 items.
- On the efficiency of polynomial time approximation schemes (Q290268) (← links)
- Approximating vertex cover in dense hypergraphs (Q450531) (← links)
- On the existence of polynomial-time approximation schemes for the reoptimization of discrete optimization problems (Q464901) (← 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 time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems (Q1305935) (← 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)
- Polynomial time approximation schemes for dense instances of NP-hard problems (Q4234075) (← links)
- Polynomial time approximation schemes for dense instances of minimum constraint satisfaction (Q4417004) (← links)
- Polynomially bounded minimization problems which are hard to approximate (Q4630248) (← links)
- Hardness and Approximation Results for <i>L<sub>p</sub></i>-Ball Constrained Homogeneous Polynomial Optimization Problems (Q5247613) (← links)
- Theory and Applications of Models of Computation (Q5898889) (← links)
