The prize-collecting edge dominating set problem in trees

Authors:
Naoyuki Kamiyama
Affiliations:
Department of Information and System Engineering, Chuo University
Venue:
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Year:
2010

Citing 6
Cited 0

Theory of linear and integer programming

Theory of linear and integer programming
A 2-approximation algorithm for the minimum weight edge dominating set problem

Discrete Applied Mathematics
Edge dominating and hypomatchable sets

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Linear Time Algorithms for Generalized Edge Dominating Set Problems

Algorithmica
Approximation algorithms for partially covering with edges

Theoretical Computer Science
Improved Approximation Algorithms for PRIZE-COLLECTING STEINER TREE and TSP

FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider the prize-collecting edge dominating set problem, which is a generalization of the edge dominating set problem. In the prize-collecting edge dominating set problem, we are not forced to dominate all edges, but we need to pay penalties for edges which are not dominated. It is known that this problem is NP-hard, and Parekh presented a 8/3-approximation algorithm. To the best of our knowledge, no polynomial-time solvable case is known for this problem. In this paper, we show that the prize-collecting edge dominating set problem in trees can be solved in polynomial time.