scientific article

DOI10.4230/LIPIcs.STACS.2010.2447zbMath1230.68084MaRDI QIDQ3113740

Andreas Björklund

Publication date: 23 January 2012

Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_2aa2.html

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

moderately exponential time algorithms\(k\)-dimensional matchingexact set cover

Mathematics Subject Classification ID

Hypergraphs (05C65) 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) Graph algorithms (graph-theoretic aspects) (05C85) Randomized algorithms (68W20)

Related Items (5)

Partition into triangles on bounded degree graphs ⋮ Narrow sieves for parameterized paths and packings ⋮ Inclusion/exclusion meets measure and conquer ⋮ Partition into Triangles on Bounded Degree Graphs ⋮ On Proving Parameterized Size Lower Bounds for Multilinear Algebraic Models

This page was built for publication: