A 2-approximation algorithm for the minimum weight edge dominating set problem
type: Item
instance of: scholarly article
title: A 2-approximation algorithm for the minimum weight edge dominating set problem
zbMATH Open document ID: 1016.68061
DOI: 10.1016/S0166-218X(00)00383-8
author: Toshihiro Fujito
author: Hiroshi Nagamochi
published in: Discrete Applied Mathematics
publication date: 2002-06-24T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1758376
zbMATH Keywords: minimum weight edge dominating set problem
zbMATH Keywords: weighted vertex cover problem
MaRDI profile type: Publication
cites work: Q4230322
cites work: Approximation algorithms for NP-complete problems on planar graphs
cites work: Q2753930
cites work: Maximum matching and a polyhedron with 0,1-vertices
cites work: Paths, Trees, and Flowers
cites work: Q5675543
cites work: Q4228484
cites work: Q5520564
cites work: Q5508779
cites work: Geometric algorithms and combinatorial optimization
cites work: Parallel concepts in graph theory
cites work: Q4526964
cites work: Minimum Edge Dominating Sets
cites work: NC-Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
cites work: Matching theory
cites work: Q3870917
cites work: Optimization, approximation, and complexity classes
cites work: Edge domination on bipartite permutation graphs and cotriangulated graphs
cites work: Edge Dominating Sets in Graphs
description: scientific article; zbMATH DE number 1758376