Pages that link to "Item:Q1771343"
From MaRDI portal
The following pages link to Polynomial approximation algorithms with performance guarantees: an introduction-by-example (Q1771343):
Displaying 4 items.
- A survey on the structure of approximation classes (Q458503) (← links)
- Approximation algorithms for minimizing the maximum lateness and makespan on parallel machines (Q2289001) (← links)
- Reductions, completeness and the hardness of approximability (Q2488898) (← links)
- When polynomial approximation meets exact computation (Q5915964) (← links)