scientific article
From MaRDI portal
Publication:3396567
zbMath1169.68669MaRDI QIDQ3396567
Fedor V. Fomin, Dieter Kratsch, Fabrizio Grandoni
Publication date: 19 September 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (23)
Data reductions, fixed parameter tractability, and random weighted \(d\)-CNF satisfiability ⋮ Improved fixed parameter tractable algorithms for two ``edge problems: MAXCUT and MAXDAG ⋮ Treewidth computation and extremal combinatorics ⋮ Colorings with few colors: counting, enumeration and combinatorial bounds ⋮ On comparing algorithms for the maximum clique problem ⋮ A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances ⋮ 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 ⋮ Linear-programming design and analysis of fast algorithms for Max 2-CSP ⋮ An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set} ⋮ Exact algorithms for edge domination ⋮ An exact algorithm for the minimum dominating clique problem ⋮ Computational study on a PTAS for planar dominating set problem ⋮ 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 ⋮ Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds ⋮ Efficient approximation of Min Set Cover by moderately exponential algorithms ⋮ On two techniques of combining branching and treewidth ⋮ Breaking Anonymity by Learning a Unique Minimum Hitting Set ⋮ Unnamed Item
This page was built for publication:
