The balanced edge cover problem

Yuta Harada, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

For an undirected graph G∈=∈(V, E), an edge cover is defined as a set of edges that covers all vertices of V. It is known that a minimum edge cover can be found in polynomial time and forms a collection of star graphs. In this paper, we consider the problem of finding a balanced edge cover where the degrees of star center vertices are balanced, which can be applied to optimize sensor network structures, for example. To this end, we formulate the problem as a minimization of the summation of strictly monotone increasing convex costs associated with degrees for covered vertices, and show that the optimality can be characterized as the non-existence of certain alternating paths. By using this characterization, we show that the optimal covers are also minimum edge covers, have the lexicographically smallest degree sequence of the covered vertices, and minimize the maximum degree of covered vertices. Based on the characterization we also present an O(|V||E|) time algorithm.

Original languageEnglish
Title of host publicationAlgorithms and Computation - 19th International Symposium, ISAAC 2008, Proceedings
Pages246-257
Number of pages12
DOIs
Publication statusPublished - Dec 1 2008
Event19th International Symposium on Algorithms and Computation, ISAAC 2008 - Gold Coast, QLD, Australia
Duration: Dec 15 2008Dec 17 2008

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5369 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other19th International Symposium on Algorithms and Computation, ISAAC 2008
CountryAustralia
CityGold Coast, QLD
Period12/15/0812/17/08

Fingerprint

Edge Cover
Stars
Sensor networks
Polynomials
Star Graph
Degree Sequence
Costs
Maximum Degree
Network Structure
Undirected Graph
Summation
Sensor Networks
Nonexistence
Star
Optimality
Monotone
Polynomial time
Strictly
Optimise
Cover

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Harada, Y., Ono, H., Sadakane, K., & Yamashita, M. (2008). The balanced edge cover problem. In Algorithms and Computation - 19th International Symposium, ISAAC 2008, Proceedings (pp. 246-257). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5369 LNCS). https://doi.org/10.1007/978-3-540-92182-0_24

The balanced edge cover problem. / Harada, Yuta; Ono, Hirotaka; Sadakane, Kunihiko; Yamashita, Masafumi.

Algorithms and Computation - 19th International Symposium, ISAAC 2008, Proceedings. 2008. p. 246-257 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5369 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Harada, Y, Ono, H, Sadakane, K & Yamashita, M 2008, The balanced edge cover problem. in Algorithms and Computation - 19th International Symposium, ISAAC 2008, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5369 LNCS, pp. 246-257, 19th International Symposium on Algorithms and Computation, ISAAC 2008, Gold Coast, QLD, Australia, 12/15/08. https://doi.org/10.1007/978-3-540-92182-0_24
Harada Y, Ono H, Sadakane K, Yamashita M. The balanced edge cover problem. In Algorithms and Computation - 19th International Symposium, ISAAC 2008, Proceedings. 2008. p. 246-257. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-540-92182-0_24
Harada, Yuta ; Ono, Hirotaka ; Sadakane, Kunihiko ; Yamashita, Masafumi. / The balanced edge cover problem. Algorithms and Computation - 19th International Symposium, ISAAC 2008, Proceedings. 2008. pp. 246-257 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{c04ab7d2b2f2458fbe3be37277e6c167,
title = "The balanced edge cover problem",
abstract = "For an undirected graph G∈=∈(V, E), an edge cover is defined as a set of edges that covers all vertices of V. It is known that a minimum edge cover can be found in polynomial time and forms a collection of star graphs. In this paper, we consider the problem of finding a balanced edge cover where the degrees of star center vertices are balanced, which can be applied to optimize sensor network structures, for example. To this end, we formulate the problem as a minimization of the summation of strictly monotone increasing convex costs associated with degrees for covered vertices, and show that the optimality can be characterized as the non-existence of certain alternating paths. By using this characterization, we show that the optimal covers are also minimum edge covers, have the lexicographically smallest degree sequence of the covered vertices, and minimize the maximum degree of covered vertices. Based on the characterization we also present an O(|V||E|) time algorithm.",
author = "Yuta Harada and Hirotaka Ono and Kunihiko Sadakane and Masafumi Yamashita",
year = "2008",
month = "12",
day = "1",
doi = "10.1007/978-3-540-92182-0_24",
language = "English",
isbn = "3540921818",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "246--257",
booktitle = "Algorithms and Computation - 19th International Symposium, ISAAC 2008, Proceedings",

}

TY - GEN

T1 - The balanced edge cover problem

AU - Harada, Yuta

AU - Ono, Hirotaka

AU - Sadakane, Kunihiko

AU - Yamashita, Masafumi

PY - 2008/12/1

Y1 - 2008/12/1

N2 - For an undirected graph G∈=∈(V, E), an edge cover is defined as a set of edges that covers all vertices of V. It is known that a minimum edge cover can be found in polynomial time and forms a collection of star graphs. In this paper, we consider the problem of finding a balanced edge cover where the degrees of star center vertices are balanced, which can be applied to optimize sensor network structures, for example. To this end, we formulate the problem as a minimization of the summation of strictly monotone increasing convex costs associated with degrees for covered vertices, and show that the optimality can be characterized as the non-existence of certain alternating paths. By using this characterization, we show that the optimal covers are also minimum edge covers, have the lexicographically smallest degree sequence of the covered vertices, and minimize the maximum degree of covered vertices. Based on the characterization we also present an O(|V||E|) time algorithm.

AB - For an undirected graph G∈=∈(V, E), an edge cover is defined as a set of edges that covers all vertices of V. It is known that a minimum edge cover can be found in polynomial time and forms a collection of star graphs. In this paper, we consider the problem of finding a balanced edge cover where the degrees of star center vertices are balanced, which can be applied to optimize sensor network structures, for example. To this end, we formulate the problem as a minimization of the summation of strictly monotone increasing convex costs associated with degrees for covered vertices, and show that the optimality can be characterized as the non-existence of certain alternating paths. By using this characterization, we show that the optimal covers are also minimum edge covers, have the lexicographically smallest degree sequence of the covered vertices, and minimize the maximum degree of covered vertices. Based on the characterization we also present an O(|V||E|) time algorithm.

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

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

U2 - 10.1007/978-3-540-92182-0_24

DO - 10.1007/978-3-540-92182-0_24

M3 - Conference contribution

AN - SCOPUS:58549112441

SN - 3540921818

SN - 9783540921813

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 246

EP - 257

BT - Algorithms and Computation - 19th International Symposium, ISAAC 2008, Proceedings

ER -