STACS 2005
From MaRDI portal
Publication:5710689
DOI10.1007/b106485zbMath1118.68500OpenAlexW4230940848MaRDI QIDQ5710689
Publication date: 2 December 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b106485
Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Randomized algorithms (68W20)
Related Items
An improved exact algorithm for the domatic number problem ⋮ An Improved SAT Algorithm in Terms of Formula Length ⋮ Treewidth computation and extremal combinatorics ⋮ Exact Algorithms for Edge Domination ⋮ Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms ⋮ Exact algorithms for dominating set ⋮ Exact algorithms for edge domination ⋮ An exact algorithm for the Boolean connectivity problem for \(k\)-CNF ⋮ An exact algorithm for the minimum dominating clique problem ⋮ Dealing with 4-variables by resolution: an improved MaxSAT algorithm ⋮ Solving connected dominating set faster than \(2^n\) ⋮ Efficient approximation of Min Set Cover by moderately exponential algorithms ⋮ On two techniques of combining branching and treewidth