Pages that link to "Item:Q4417004"
From MaRDI portal
The following pages link to Polynomial time approximation schemes for dense instances of minimum constraint satisfaction (Q4417004):
Displaying 4 items.
- Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems (Q1305935) (← links)
- Approximation Schemes for the Betweenness Problem in Tournaments and Related Ranking Problems (Q3088101) (← links)
- Polynomial time approximation schemes for dense instances of NP-hard problems (Q4234075) (← links)
- Polynomial time approximation schemes for some dense instances of NP-hard optimization problems (Q5945918) (← links)