scientific article; zbMATH DE number 2086690
From MaRDI portal
Publication:4737227
zbMath1057.68079MaRDI QIDQ4737227
Publication date: 11 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2380/23801005.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Counting frequent patterns in large labeled graphs: a hypergraph-based approach, Approximating vertex cover in dense hypergraphs, Vertex cover might be hard to approximate to within \(2 - \varepsilon \), Distributed set cover approximation: Primal-dual with optimal locality
