scientific article
From MaRDI portal
Publication:2766822
zbMath0988.68081MaRDI QIDQ2766822
Venkatesh Raman, Subhash A. Khot
Publication date: 22 July 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (4)
Additive approximation for edge-deletion problems ⋮ From Gap-Exponential Time Hypothesis to Fixed Parameter Tractable Inapproximability: Clique, Dominating Set, and More ⋮ Parameterized Complexity ⋮ Revising Johnson's table for the 21st century
This page was built for publication:
