scientific article; zbMATH DE number 6783496
From MaRDI portal
Publication:5365143
zbMath1376.68054MaRDI QIDQ5365143
Ali Kemal Sinop, Venkatesan Guruswami
Publication date: 29 September 2017
Full work available at URL: http://dl.acm.org/citation.cfm?id=2133161
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hypergraphs (05C65) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (4)
Making the Long Code Shorter ⋮ Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in \(\boldsymbol{H}\)-Free Graphs ⋮ Recoverable Values for Independent Sets ⋮ Column subset selection via sparse approximation of SVD
This page was built for publication:
