Improved Inapproximability Results for Maximum k-Colorable Subgraph

From MaRDI portal

Revision as of 05:37, 5 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3638876

Jump to:navigation, search

DOI10.1007/978-3-642-03685-9_13zbMath1255.68072OpenAlexW2122906648MaRDI QIDQ3638876

Ali Kemal Sinop, Venkatesan Guruswami

Publication date: 28 October 2009

Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-03685-9_13

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

New NP-Hardness Results for 3-Coloring and 2-to-1 Label Cover

This page was built for publication: Improved Inapproximability Results for Maximum k-Colorable Subgraph

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3638876&oldid=17080223"