On approximability of the independent/connected edge dominating set problems-Reference-Cited by-同舟云学术

On approximability of the independent/connected edge dominating set problems

Published:2001-09 Issue:6 Volume:79 Page:261-266
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Fujito Toshihiro

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference20 articles.

1. Approximating the tree and tour covers of a graph;Arkin;Inform. Process. Lett.,1993

2. A local-ratio theorem for approximating the weighted vertex cover problem;Bar-Yehuda,1985

3. A 2110-approximation algorithm for a generalization of the weighted edge-dominating set problem;Carr,2000

4. A threshold of lnn for approximating set cover;Feige,1996

5. T. Fujito, H. Nagamochi, A 2-approximation algorithm for the minimum weight edge dominating set problem, Discrete Appl. Math., to appear. PII S0166-218X(00)00383-8

Cited by 27 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Graph Covering Using Bounded Size Subgraphs;Algorithms and Discrete Applied Mathematics;2023

2. Two Heuristic Algorithms for the Minimum Weighted Connected Vertex Cover Problem Under Greedy Strategy;IEEE Access;2022

3. Note on Dominating Set Problems;Journal of Communications Technology and Electronics;2021-12

4. Approximation algorithms for minimum weight connected 3-path vertex cover;Applied Mathematics and Computation;2019-04

5. Distributed Algorithms for Multi-Layer Connected Edge Dominating Sets;IEEE Control Systems Letters;2019-01