Pages that link to "Item:Q1076513"
From MaRDI portal
The following pages link to An introduction to the analysis of approximation algorithms (Q1076513):
Displaying 9 items.
- Fast exact and approximate algorithms for \(k\)-partition and scheduling independent tasks (Q685660) (← links)
- A tight analysis and near-optimal instances of the algorithm of Anderson and Woll (Q706634) (← links)
- On the complexity of test case generation for NP-hard problems (Q917311) (← links)
- The rate of convergence to optimality of the LPT rule (Q1087469) (← links)
- Generating hard and diverse test sets for NP-hard graph problems (Q1805463) (← links)
- Fixed-Parameter and Approximation Algorithms: A New Look (Q2867077) (← links)
- Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : de la structure de NPO à la structure des instances (Q4457892) (← links)
- An Introduction to the Analysis of Algorithms (Q4602026) (← links)
- Autour de nouvelles notions pour l'analyse des algorithmes d'approximation : formalisme unifié et classes d'approximation (Q4809670) (← links)
