The min-max Edge q-Coloring Problem

Tommi Larjomaa; Alexandru Popa

doi:10.1007/978-3-319-19315-1_20

The min-max Edge q-Coloring Problem

Tommi Larjomaa, Alexandru Popa^*

^*Corresponding author for this work

Department of Communications and Networking

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Scientific › peer-review

2 Citations (Scopus)

Abstract

In this paper we introduce and study a new problem named min-max edge q-coloring which is motivated by applications in wireless mesh networks. The input of the problem consists of an undirected graph and an integer q. The goal is to color the edges of the graph with as many colors as possible such that: (a) any vertex is incident to at most q different colors, and (b) the maximum size of a color group (i.e. set of edges identically colored) is minimized. We show the following results: 1. Min-max edge q-coloring is NP-hard, for any q ≥ 2. 2. A polynomial time exact algorithm for min-max edge q-coloring on trees. 3. Exact formulas of the optimal solution for cliques. 4. An approximation algorithm for planar graphs.

Original language	English
Title of host publication	Combinatorial Algorithms - 25th International Workshop, IWOCA 2014, Revised Selected Papers
Publisher	Springer Verlag
Pages	226-237
Number of pages	12
Volume	8986
ISBN (Electronic)	9783319193144
DOIs	https://doi.org/10.1007/978-3-319-19315-1_20
Publication status	Published - 2014
MoE publication type	A4 Article in a conference publication
Event	International Workshop on Combinatorial Algorithms - Duluth, United States Duration: 15 Oct 2014 → 17 Oct 2014 Conference number: 25

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	8986
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	International Workshop on Combinatorial Algorithms
Abbreviated title	IWOCA
Country	United States
City	Duluth
Period	15/10/2014 → 17/10/2014

Access to Document

10.1007/978-3-319-19315-1_20

Link to publication in Scopus

Fingerprint Dive into the research topics of 'The min-max Edge q-Coloring Problem'. Together they form a unique fingerprint.

Cite this

Larjomaa, T., & Popa, A. (2014). The min-max Edge q-Coloring Problem. In Combinatorial Algorithms - 25th International Workshop, IWOCA 2014, Revised Selected Papers (Vol. 8986, pp. 226-237). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8986). Springer Verlag. https://doi.org/10.1007/978-3-319-19315-1_20

@inproceedings{76f208a76eb448228abebec98b3ca3d2,

title = "The min-max Edge q-Coloring Problem",

abstract = "In this paper we introduce and study a new problem named min-max edge q-coloring which is motivated by applications in wireless mesh networks. The input of the problem consists of an undirected graph and an integer q. The goal is to color the edges of the graph with as many colors as possible such that: (a) any vertex is incident to at most q different colors, and (b) the maximum size of a color group (i.e. set of edges identically colored) is minimized. We show the following results: 1. Min-max edge q-coloring is NP-hard, for any q ≥ 2. 2. A polynomial time exact algorithm for min-max edge q-coloring on trees. 3. Exact formulas of the optimal solution for cliques. 4. An approximation algorithm for planar graphs.",

author = "Tommi Larjomaa and Alexandru Popa",

year = "2014",

doi = "10.1007/978-3-319-19315-1_20",

language = "English",

volume = "8986",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "226--237",

booktitle = "Combinatorial Algorithms - 25th International Workshop, IWOCA 2014, Revised Selected Papers",

address = "Germany",

note = "International Workshop on Combinatorial Algorithms, IWOCA ; Conference date: 15-10-2014 Through 17-10-2014",

}

Larjomaa, T & Popa, A 2014, The min-max Edge q-Coloring Problem. in Combinatorial Algorithms - 25th International Workshop, IWOCA 2014, Revised Selected Papers. vol. 8986, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8986, Springer Verlag, pp. 226-237, International Workshop on Combinatorial Algorithms, Duluth, United States, 15/10/2014. https://doi.org/10.1007/978-3-319-19315-1_20

The min-max Edge q-Coloring Problem. / Larjomaa, Tommi; Popa, Alexandru.

Combinatorial Algorithms - 25th International Workshop, IWOCA 2014, Revised Selected Papers. Vol. 8986 Springer Verlag, 2014. p. 226-237 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8986).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Scientific › peer-review

TY - GEN

T1 - The min-max Edge q-Coloring Problem

AU - Larjomaa, Tommi

AU - Popa, Alexandru

N1 - Conference code: 25

PY - 2014

Y1 - 2014

N2 - In this paper we introduce and study a new problem named min-max edge q-coloring which is motivated by applications in wireless mesh networks. The input of the problem consists of an undirected graph and an integer q. The goal is to color the edges of the graph with as many colors as possible such that: (a) any vertex is incident to at most q different colors, and (b) the maximum size of a color group (i.e. set of edges identically colored) is minimized. We show the following results: 1. Min-max edge q-coloring is NP-hard, for any q ≥ 2. 2. A polynomial time exact algorithm for min-max edge q-coloring on trees. 3. Exact formulas of the optimal solution for cliques. 4. An approximation algorithm for planar graphs.

AB - In this paper we introduce and study a new problem named min-max edge q-coloring which is motivated by applications in wireless mesh networks. The input of the problem consists of an undirected graph and an integer q. The goal is to color the edges of the graph with as many colors as possible such that: (a) any vertex is incident to at most q different colors, and (b) the maximum size of a color group (i.e. set of edges identically colored) is minimized. We show the following results: 1. Min-max edge q-coloring is NP-hard, for any q ≥ 2. 2. A polynomial time exact algorithm for min-max edge q-coloring on trees. 3. Exact formulas of the optimal solution for cliques. 4. An approximation algorithm for planar graphs.

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

U2 - 10.1007/978-3-319-19315-1_20

DO - 10.1007/978-3-319-19315-1_20

M3 - Conference contribution

AN - SCOPUS:84937485497

VL - 8986

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

SP - 226

EP - 237

BT - Combinatorial Algorithms - 25th International Workshop, IWOCA 2014, Revised Selected Papers

PB - Springer Verlag

T2 - International Workshop on Combinatorial Algorithms

Y2 - 15 October 2014 through 17 October 2014

ER -

Larjomaa T, Popa A. The min-max Edge q-Coloring Problem. In Combinatorial Algorithms - 25th International Workshop, IWOCA 2014, Revised Selected Papers. Vol. 8986. Springer Verlag. 2014. p. 226-237. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-319-19315-1_20