Abstract
We consider the minimum-cost \(b\)-edge dominating set problem. This is a generalization of the edge dominating set problem, but the computational complexity for trees is an astonishing open problem. We make steps toward the resolution of this open problem in the following three directions. (1) We give the first combinatorial polynomial-time algorithm for paths. Prior to our work, the polynomial-time algorithm for paths used linear programming, and it was known that the linear-programming approach could not be extended to trees. Thus, our algorithm would yield an alternative approach to a possible polynomial-time algorithm for trees. (2) We give a fixed-parameter algorithm for trees with the number of leaves as a parameter. Thus, a possible NP-hardness proof for trees should make use of trees with unbounded number of leaves. (3) We give a fully polynomial-time approximation scheme for trees. Prior to our work, the best known approximation factor was two. If the problem is NP-hard, then a possible proof cannot be done via a gap-preserving reduction from any APX-hard problem unless P \(=\) NP.
Takehiro Ito: Supported by JSPS KAKENHI Grant Numbers 25106504, 25330003.
Naonori Kakimura: Supported by JST, ERATO, Kawarabayashi Large Graph Project, and by JSPS KAKENHI Grant Numbers 25730001, 24106002.
Naoyuki Kamiyama: Supported by JSPS KAKENHI Grant Number 24106005.
Yusuke Kobayashi: Supported by JST, ERATO, Kawarabayashi Large Graph Project, and by JSPS KAKENHI Grant Numbers 24106002, 24700004.
Yoshio Okamoto: Supported by Grant-in-Aid for Scientific Research from Ministry of Education, Science and Culture, Japan, and Japan Society for the Promotion of Science (JSPS).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Berger, A., Fukunaga, T., Nagamochi, H., Parekh, O.: Approximability of the capacitated-edge dominating set problem. Theor. Comput. Sci. 385(1–3), 202–213 (2007)
Berger, A., Parekh, O.: Linear time algorithms for generalized edge dominating set problems. Algorithmica 50(2), 244–254 (2008)
Berger, A., Parekh, O.: Erratum to: Linear Time Algorithms for Generalized Edge Dominating Set Problems. Algorithmica 62(1), 633–634 (2012)
Dadush, D., Peikert, C., Vempala, S.: Enumerative lattice algorithms in any norm via M-ellipsoid coverings. In: FOCS, pp. 580–589 (2011)
Dadush, D., Vempala, S.: Deterministic construction of an approximate M-ellipsoid and its applications to derandomizing lattice algorithms. In: SODA, pp. 1445–1456 (2012)
Fujito, T., Nagamochi, H.: A \(2\)-approximation algorithm for the minimum weight edge dominating set problem. Discrete Appl. Math. 118(3), 199–207 (2002)
Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer (2004)
Lenstra, H.W.: Integer programming with a fixed number of variables. Math. Oper. Res. 8(4), 538–548 (1983)
Parekh, O.: Edge dominating and hypomatchable sets. In: SODA, 287–291 (2002)
Schrijver, A.: Theory of Linear and Integer Programming. John Wiley & Sons (1986)
Tardos, É.: A strongly polynomial algorithm to solve combinatorial linear programs. Operations Research 34(2), 250–256 (1986)
Vazirani, V.V.: Approximation algorithms. Springer (2001)
Yannakakis, M., Gavril, F.: Edge dominating sets in graphs. SIAM J. Appl. Math. 38(3), 364–372 (1980)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Ito, T., Kakimura, N., Kamiyama, N., Kobayashi, Y., Okamoto, Y. (2014). Minimum-Cost \(b\)-Edge Dominating Sets on Trees. In: Ahn, HK., Shin, CS. (eds) Algorithms and Computation. ISAAC 2014. Lecture Notes in Computer Science(), vol 8889. Springer, Cham. https://doi.org/10.1007/978-3-319-13075-0_16
Download citation
DOI: https://doi.org/10.1007/978-3-319-13075-0_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-13074-3
Online ISBN: 978-3-319-13075-0
eBook Packages: Computer ScienceComputer Science (R0)