Parameterized measure \& conquer for problems with no small kernels
type: Item
instance of: scholarly article
title: Parameterized measure \& conquer for problems with no small kernels
zbMATH Open document ID: 1253.68376
author: Daniel Binkele-Raible
author: Henning Fernau
published in: Algorithmica
publication date: 2012-11-21T00:00:00Z
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 6109463
zbMATH Keywords: measure and conquer
zbMATH Keywords: graph problems
zbMATH Keywords: analysis of algorithms
zbMATH Keywords: computationally hard problems
MaRDI profile type: Publication
full work available at URL: s00453-011-9566-6
OpenAlex ID: W1984814702
cites work: A new upper bound for Max-2-SAT: A graph-theoretic approach
cites work: Enumerate and Measure: Improving Parameter Budget Management
cites work: Labeled search trees and amortized analysis: Improved upper bounds for NP-hard problems
cites work: FPT algorithms and kernels for the directed \(k\)-leaf problem
cites work: Incompressibility through Colors and IDs
cites work: edge dominating set: Efficient Enumeration-Based Exact Algorithms
cites work: The Curse of Connectivity: t-Total Vertex (Edge) Cover
cites work: Exact and Parameterized Algorithms for Max Internal Spanning Tree
cites work: Vertex and edge covers with clustering properties: Complexity and algorithms
cites work: Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs
cites work: On two techniques of combining branching and treewidth
cites work: A measure & conquer approach for the analysis of exact algorithms
cites work: Exact exponential algorithms.
cites work: On approximability of the independent/connected edge dominating set problems
cites work: A 2-approximation NC algorithm for connected vertex cover and tree cover
cites work: A universally fastest algorithm for Max 2-sat, Max 2-CSP, and everything in between
cites work: Parameterized complexity of Vertex Cover variants
cites work: A New Algorithm for Finding Trees with Many Leaves
cites work: Enumerate and expand: Improved algorithms for connected vertex cover and tree cover
cites work: Q5710169
cites work: Equivalence between the minimum covering problem and the maximum matching problem
cites work: Constrained weighted matchings and edge coverings in graphs
cites work: An Amortized Search Tree Analysis for k-Leaf Spanning Tree
cites work: Theoretical Computer Science
cites work: Faster computation of maximum independent set and parameterized vertex cover for graphs with maximum degree 3
cites work: Q4910758
cites work: Inclusion/Exclusion Meets Measure and Conquer
cites work: Edge Dominating Sets in Graphs
DOI: 10.1007/S00453-011-9566-6
description: scientific article; zbMATH DE number 6109463