Subexponential algorithms for partial cover problems
type: Item
instance of: scholarly article
title: Subexponential algorithms for partial cover problems
zbMATH Open document ID: 1260.05159
author: Fedor V. Fomin
author: Daniel Lokshtanov
author: Venkatesh Raman
author: Saket Saurabh
published in: Information Processing Letters
publication date: 2013-04-04T00:00:00Z
full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2009/2318/
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 6150445
zbMATH Keywords: graph algorithms
zbMATH Keywords: parameterized algorithms
zbMATH Keywords: subexponential algorithms
zbMATH Keywords: partial cover problems
zbMATH Keywords: partial dominating set
Wikidata QID: Q60488590
MaRDI profile type: Publication
OpenAlex ID: W2047916710
cites work: Implicit Branching and Parameterized Partial Cover Problems (Extended Abstract)
cites work: Q4952696
cites work: Q4252274
cites work: Computing small partial coverings
cites work: Subexponential parameterized algorithms on bounded-genus graphs and H -minor-free graphs
cites work: Linearity of grid minors in treewidth with applications through bidimensionality
cites work: Bidimensionality: new connections between FPT algorithms and PTASs
cites work: Subexponential parameterized algorithms
cites work: Q4393480
cites work: Parametrized complexity theory.
cites work: Contraction Bidimensionality: The Accurate Picture
cites work: Approximation algorithms for partial covering problems
cites work: Parameterized complexity of Vertex Cover variants
cites work: An Improved Algorithm for Finding Cycles Through Elements
cites work: The Induced Disjoint Paths Problem
cites work: Q3579485
cites work: Q4633933
cites work: Improved Upper Bounds for Partial Vertex Cover
cites work: Intuitive Algorithms and t-Vertex Cover
cites work: Partial vs. Complete Domination: t-Dominating Set
cites work: Q4633929
cites work: Q5710169
cites work: Quickly excluding a planar graph
cites work: Graph minors. XIII: The disjoint paths problem
DBLP publication ID: journals/ipl/FominLRS11
DOI: 10.1016/J.IPL.2011.05.016
description: scientific article; zbMATH DE number 6150445