Implicit branching and parameterized partial cover problems
type: Item
instance of: scholarly article
title: Implicit branching and parameterized partial cover problems
zbMATH Open document ID: 1245.05124
author: Omid Amini
author: Fedor V. Fomin
author: Saket Saurabh
published in: Journal of Computer and System Sciences
publication date: 2012-01-11T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5996373
zbMATH Keywords: partial covering problems in graphs
zbMATH Keywords: implicit branching
MaRDI profile type: Publication
Wikidata QID: Q60488569
full work available at URL: j.jcss.2010.12.002
OpenAlex ID: W2021156120
cites work: A refined search tree technique for dominating set on planar graphs
cites work: Polynomial-time data reduction for dominating set
cites work: Linear time algorithms for finding a dominating set of fixed size in degenerated graphs
cites work: Implicit Branching and Parameterized Partial Cover Problems (Extended Abstract)
cites work: A \(2+\varepsilon\) approximation algorithm for the \(k\)-MST problem
cites work: Computing small partial coverings
cites work: Using homogeneous weights for approximating the partial cover problem
cites work: (Meta) Kernelization
cites work: Treewidth lower bounds with brambles
cites work: Algorithms for facility location problems with outliers. (Extended abstract)
cites work: Improved upper bounds for vertex cover
cites work: Fixed-parameter algorithms for ( k , r )-center in planar graphs and map graphs
cites work: Subexponential parameterized algorithms on bounded-genus graphs and H -minor-free graphs
cites work: Diameter and treewidth in minor-closed graph families, revisited
cites work: Subexponential parameterized algorithms
cites work: Q4393480
cites work: Diameter and treewidth in minor-closed graph families
cites work: Parametrized complexity theory.
cites work: Bidimensionality and Geometric Graphs
cites work: Approximation algorithms for partial covering problems
cites work: Parameterized Complexity for Domination Problems on Degenerate Graphs
cites work: Local tree-width, excluded minors, and approximation algorithms
cites work: Parameterized complexity of Vertex Cover variants
cites work: Partial vs. Complete Domination: t-Dominating Set
cites work: Intuitive Algorithms and t-Vertex Cover
cites work: Q5710169
cites work: Graph minors. V. Excluding a planar graph
cites work: Quickly excluding a planar graph
cites work: Graph minors. XVI: Excluding a non-planar graph
cites work: Call routing and the ratcatcher
DOI: 10.1016/J.JCSS.2010.12.002
Recommended article: Implicit Branching and Parameterized Partial Cover Problems (Extended Abstract)
Recommended article: Algorithmic aspects of branched coverings
Recommended article: Subexponential algorithms for partial cover problems
Recommended article: A unified approach to approximating partial covering problems
Recommended article: A Unified Approach to Approximating Partial Covering Problems
Recommended article: Approximation algorithms for partial covering problems
Recommended article: The Approximability of Partial Vertex Covers in Trees
Recommended article: Parameterized Algorithms for Partial Vertex Covers in Bipartite Graphs
Recommended article: On the parameterized complexity of the expected coverage problem
description: scientific article; zbMATH DE number 5996373