On the efficiency of polynomial time approximation schemes
- 1 November 1997
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 64 (4), 165-171
- https://doi.org/10.1016/s0020-0190(97)00164-6
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Computation Models for Parameterized ComplexityMathematical Logic Quarterly, 1997
- Fixed-Parameter Tractability and Completeness I: Basic ResultsSIAM Journal on Computing, 1995
- Fixed-parameter tractability and completeness IV: On completeness for W[P] and PSPACE analoguesAnnals of Pure and Applied Logic, 1995
- Fixed-parameter tractability and completeness II: On completeness for W[1]Theoretical Computer Science, 1995
- Using dual approximation algorithms for scheduling problems theoretical and practical resultsJournal of the ACM, 1987