Minimum-Cost b-Edge Dominating Sets on Trees

Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto

Research output: Contribution to journalArticle

Abstract

In this paper, 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.

Original languageEnglish
Pages (from-to)343-366
Number of pages24
JournalAlgorithmica
Volume81
Issue number1
DOIs
Publication statusPublished - Jan 15 2019

Fingerprint

Dominating Set
Polynomials
Costs
Polynomial-time Algorithm
Linear programming
Computational complexity
Open Problems
Leaves
Trees (mathematics)
Fully Polynomial Time Approximation Scheme
Fixed-parameter Algorithms
Path
Combinatorial Algorithms
NP-hardness
Hardness
Best Approximation
Computational Complexity
NP-complete problem
Alternatives

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Computer Science Applications
  • Applied Mathematics

Cite this

Ito, T., Kakimura, N., Kamiyama, N., Kobayashi, Y., & Okamoto, Y. (2019). Minimum-Cost b-Edge Dominating Sets on Trees. Algorithmica, 81(1), 343-366. https://doi.org/10.1007/s00453-018-0448-z

Minimum-Cost b-Edge Dominating Sets on Trees. / Ito, Takehiro; Kakimura, Naonori; Kamiyama, Naoyuki; Kobayashi, Yusuke; Okamoto, Yoshio.

In: Algorithmica, Vol. 81, No. 1, 15.01.2019, p. 343-366.

Research output: Contribution to journalArticle

Ito, T, Kakimura, N, Kamiyama, N, Kobayashi, Y & Okamoto, Y 2019, 'Minimum-Cost b-Edge Dominating Sets on Trees', Algorithmica, vol. 81, no. 1, pp. 343-366. https://doi.org/10.1007/s00453-018-0448-z
Ito T, Kakimura N, Kamiyama N, Kobayashi Y, Okamoto Y. Minimum-Cost b-Edge Dominating Sets on Trees. Algorithmica. 2019 Jan 15;81(1):343-366. https://doi.org/10.1007/s00453-018-0448-z
Ito, Takehiro ; Kakimura, Naonori ; Kamiyama, Naoyuki ; Kobayashi, Yusuke ; Okamoto, Yoshio. / Minimum-Cost b-Edge Dominating Sets on Trees. In: Algorithmica. 2019 ; Vol. 81, No. 1. pp. 343-366.
@article{70bf40675fad44358f06f859b8adcffa,
title = "Minimum-Cost b-Edge Dominating Sets on Trees",
abstract = "In this paper, 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.",
author = "Takehiro Ito and Naonori Kakimura and Naoyuki Kamiyama and Yusuke Kobayashi and Yoshio Okamoto",
year = "2019",
month = "1",
day = "15",
doi = "10.1007/s00453-018-0448-z",
language = "English",
volume = "81",
pages = "343--366",
journal = "Algorithmica",
issn = "0178-4617",
publisher = "Springer New York",
number = "1",

}

TY - JOUR

T1 - Minimum-Cost b-Edge Dominating Sets on Trees

AU - Ito, Takehiro

AU - Kakimura, Naonori

AU - Kamiyama, Naoyuki

AU - Kobayashi, Yusuke

AU - Okamoto, Yoshio

PY - 2019/1/15

Y1 - 2019/1/15

N2 - In this paper, 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.

AB - In this paper, 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.

UR - http://www.scopus.com/inward/record.url?scp=85046826637&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85046826637&partnerID=8YFLogxK

U2 - 10.1007/s00453-018-0448-z

DO - 10.1007/s00453-018-0448-z

M3 - Article

AN - SCOPUS:85046826637

VL - 81

SP - 343

EP - 366

JO - Algorithmica

JF - Algorithmica

SN - 0178-4617

IS - 1

ER -