Parameterized approximation of dominating set problems
type: Item
instance of: scholarly article
title: Parameterized approximation of dominating set problems
zbMATH Open document ID: 1191.68862
author: Catherine McCartin
author: Rodney G. Downey
author: Michael R. Fellows
author: Frances Rosamond
published in: Information Processing Letters
publication date: 2010-06-09T00:00:00Z
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 5719240
zbMATH Keywords: parameterized complexity
zbMATH Keywords: FPT approximation
zbMATH Keywords: approximation algorithms
MaRDI profile type: Publication
full work available at URL: j.ipl.2008.09.017
OpenAlex ID: W2030965968
Wikidata QID: Q57359917
cites work: On Parameterized Approximability
cites work: Fixed-Parameter Approximation: Conceptual Framework and Approximability Results
cites work: Q4393480
cites work: Parameterized and Exact Computation
cites work: The Parameterized Complexity of Counting Problems
cites work: Parameterized Approximability of the Disjoint Cycle Problem
cites work: Searching the \(k\)-change neighborhood for TSP is W[1]-hard
cites work: Q5710169
DOI: 10.1016/J.IPL.2008.09.017
description: scientific article; zbMATH DE number 5719240