Optimization, approximation, and complexity classes
Journal of Computer and System Sciences1991Vol. 43(3), pp. 425–440
Citations Over TimeTop 1% of 1991 papers
Related Papers
- → Fully polynomial time approximation scheme for the weighted flow-time minimization on a single machine with a fixed non-availability interval(2008)41 cited
- → Approximation Schemes for 0-1 Knapsack(2018)21 cited
- → Improved approximation algorithms for two-stage flowshops scheduling problem(2019)5 cited
- → Approximation Algorithms for the Weight-Reducible Knapsack Problem(2014)4 cited
- → Approximation Algorithms for Scheduling with Reservations(2007)5 cited