Theoretical Computer Science · 2008 · 102 citations · 24 references
ComputingComputer ScienceMathematicsAlgorithmsCombinatoricsTheory Of ComputationAlgorithmic ComplexityComputational ComplexityDirected Acyclic GraphsGraph AlgorithmsGraph TheoryTime ComplexityComplexityComplexity AnalysisComplexity MeasuresComputational Complexity Of Graph AlgorithmsGraph DecompositionsNp-complete ProblemsPolynomial Time ComplexityPolynomial-time Algorithms
24
Approximation algorithms for NP-complete problems on planar graphs
Brenda S. Baker · Journal of the ACM · 1994 · 973 citations · Full text