Publication:3396567

zbMath1169.68669MaRDI QIDQ3396567

Dieter Kratsch, Fedor V. Fomin, Fabrizio Grandoni

Publication date: 19 September 2009

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68W40: Analysis of algorithms

Related Items

Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms, Exact algorithms for dominating set, Data reductions, fixed parameter tractability, and random weighted \(d\)-CNF satisfiability, Solving connected dominating set faster than \(2^n\), Exact algorithms for exact satisfiability and number of perfect matchings, On the minimum feedback vertex set problem: Exact and enumeration algorithms, Finding a dominating set on bipartite graphs, Efficient approximation of Min Set Cover by moderately exponential algorithms, On two techniques of combining branching and treewidth, Exact algorithms for edge domination, Improved fixed parameter tractable algorithms for two ``edge problems: MAXCUT and MAXDAG, Linear-programming design and analysis of fast algorithms for Max 2-CSP, An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set}, An exact algorithm for the minimum dominating clique problem, Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds, Breaking Anonymity by Learning a Unique Minimum Hitting Set, A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances, Exact Algorithms for Edge Domination