Tight approximation bounds for dominating set on graphs of bounded arboricity
type: Item
instance of: scholarly article
title: Tight approximation bounds for dominating set on graphs of bounded arboricity
zbMATH Open document ID: 1422.68291
author: N. Bansal
author: Seeun William Umboh
published in: Information Processing Letters
publication date: 2017-11-03T00:00:00Z
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6802741
zbMATH Keywords: dominating set
zbMATH Keywords: bounded arboricity
zbMATH Keywords: approximation algorithms
MaRDI profile type: Publication
full work available at URL: j.ipl.2017.01.011
OpenAlex ID: W2589200750
cites work: Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems
cites work: Approximation hardness of dominating set problems in bounded degree graphs
cites work: A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover
cites work: Analytical approach to parallel repetition
cites work: Strong lower bounds on the approximability of some NPO PB-complete maximization problems
cites work: On the power of unique 2-prover 1-round games
cites work: Minimum Dominating Set Approximation in Graphs of Bounded Arboricity
DOI: 10.1016/J.IPL.2017.01.011
description: scientific article; zbMATH DE number 6802741