Approximation schemes using L-reductions

DOI10.1007/3-540-58715-2_136MaRDI QIDQ4470517zbMATH OpenFDO

Authors V. Radhakrishnan, S. S. Ravi, R. E. Stearns, H. B. III Hunt, Madhav V. Marathe, Daniel J. Rosenkrantz

Publication date 1 July 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-58715-2_136

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Cited in

(4)

• Parallel approximation schemes for a class of planar and near planar combinatorial optimization problems.
• Max NP-completeness made easy
• Shifting strategy for geometric graphs without geometry
• Parallel approximation of optimization problems

This page was built for publication: Approximation schemes using \(L\)-reductions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4470517)