scientific article; zbMATH DE number 6146493
From MaRDI portal
Publication:4910758
DOI10.4230/LIPIcs.STACS.2008.1329zbMath1259.68097MaRDI QIDQ4910758
Johan M. M. van Rooij, Hans L. Bodlaender
Publication date: 19 March 2013
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_ed28.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
dominating setexact algorithmsexponential time algorithmsbranch and reducecomputer aided algorithm designmeasure and conquer
Analysis of algorithms and problem complexity (68Q25) Computer science aspects of computer-aided design (68U07) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (max. 100)
A Faster Algorithm for Dominating Set Analyzed by the Potential Method ⋮ On Independent Sets and Bicliques in Graphs ⋮ Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms ⋮ Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA ⋮ Exact Algorithms for Edge Domination ⋮ Exact algorithms for dominating set ⋮ A strengthened analysis of an algorithm for dominating set in planar graphs ⋮ Fast algorithms for max independent set ⋮ On independent sets and bicliques in graphs ⋮ An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set} ⋮ Sharp separation and applications to exact and parameterized algorithms ⋮ Exact algorithms for edge domination ⋮ An exact algorithm for connected red-blue dominating set ⋮ Finding a dominating set on bipartite graphs ⋮ Parameterized measure \& conquer for problems with no small kernels ⋮ Enumerate and Measure: Improving Parameter Budget Management ⋮ Inclusion/Exclusion Branching for Partial Dominating Set and Set Splitting ⋮ Efficient approximation of Min Set Cover by moderately exponential algorithms
This page was built for publication:
