Approximation schemes using L-reductions
- 1 January 1994
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- A linear-processor polylog-time algorithm for shortest paths in planar graphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Generalized CNF satisfiability problems and non-efficient approximabilityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Approximation algorithms for NP-complete problems on planar graphsJournal of the ACM, 1994
- Efficient parallel shortest-paths in digraphs with a separator decompositionPublished by Association for Computing Machinery (ACM) ,1993
- Parallel approximation schemes for problems on planar graphsPublished by Springer Nature ,1993
- An efficient parallel algorithm for computing a large independent set in a planar graphAlgorithmica, 1991
- Maximum bounded 3-dimensional matching is MAX SNP-completeInformation Processing Letters, 1991
- Planar Formulae and Their UsesSIAM Journal on Computing, 1982
- Dynamic Programming is Optimal for Nonserial Optimization ProblemsSIAM Journal on Computing, 1982
- Applications of a Planar Separator TheoremSIAM Journal on Computing, 1980