Searching Trees: An Essay
From MaRDI portal
Publication:3630190
DOI10.1007/978-3-642-02017-9_9zbMath1241.68058OpenAlexW1528383742MaRDI QIDQ3630190
Publication date: 3 June 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02017-9_9
Related Items
A novel parameterised approximation algorithm for \textsc{minimum vertex cover} ⋮ A new upper bound for Max-2-SAT: A graph-theoretic approach ⋮ Constraint bipartite vertex cover: simpler exact algorithms and implementations ⋮ Charge and reduce: A fixed-parameter algorithm for string-to-string correction ⋮ Computing the differential of a graph: hardness, approximability and exact algorithms ⋮ Parameterized algorithms for \(d\)-hitting set: the weighted case