On approximability of the independent/connected edge dominating set problems
type: Item
instance of: scholarly article
title: On approximability of the independent/connected edge dominating set problems
zbMATH Open document ID: 1032.68120
DOI: 10.1016/S0020-0190(01)00138-7
author: Toshihiro Fujito
published in: Information Processing Letters
publication date: 2002-07-14T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68R05
zbMATH DE Number: 1767191
zbMATH Keywords: Combinatorial optimization problems
zbMATH Keywords: Approximation algorithms
zbMATH Keywords: Edge dominating set
MaRDI profile type: Publication
cites work: Approximating the tree and tour covers of a graph
cites work: Q3337224
cites work: Q2753930
cites work: Q4228484
cites work: A 2-approximation algorithm for the minimum weight edge dominating set problem
cites work: The Rectilinear Steiner Tree Problem is $NP$-Complete
cites work: Geometric algorithms and combinatorial optimization
cites work: Approximation algorithms for connected dominating sets
cites work: Q4247267
cites work: Approximating the minimum maximal independence number
cites work: Parallel concepts in graph theory
cites work: On approximating the minimum independent dominating set
cites work: Q4142699
cites work: A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
cites work: Q2753739
cites work: Q4252355
cites work: Q4952699
cites work: Depth-first search and the vertex cover problem
cites work: An analysis of the greedy algorithm for the submodular set covering problem
cites work: Edge Dominating Sets in Graphs
description: scientific article; zbMATH DE number 1767191