Even Faster Algorithm for Set Splitting!
From MaRDI portal
Publication:3656870
DOI10.1007/978-3-642-11269-0_24zbMath1273.68272OpenAlexW1506916381MaRDI QIDQ3656870
Daniel Lokshtanov, Saket Saurabh
Publication date: 14 January 2010
Published in: Parameterized and Exact Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-11269-0_24
Analysis of algorithms and problem complexity (68Q25) Combinatorics in computer science (68R05) Extremal set theory (05D05)
Related Items (5)
On the complexity of exchanging ⋮ Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree} ⋮ Lower bounds on kernelization ⋮ Inclusion/exclusion meets measure and conquer ⋮ Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting
This page was built for publication: Even Faster Algorithm for Set Splitting!
