STACS 2005
From MaRDI portal
Publication:5710689
DOI10.1007/b106485zbMath1118.68500MaRDI 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
68Q25: Analysis of algorithms and problem complexity
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
68W20: Randomized algorithms
Related Items
Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms, Exact algorithms for dominating set, Dealing with 4-variables by resolution: an improved MaxSAT algorithm, An exact algorithm for the Boolean connectivity problem for \(k\)-CNF, An improved exact algorithm for the domatic number problem, 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, Exact algorithms for edge domination, Treewidth computation and extremal combinatorics, An exact algorithm for the minimum dominating clique problem, An Improved SAT Algorithm in Terms of Formula Length, Exact Algorithms for Edge Domination