The min-max Edge q-Coloring Problem

Tommi Larjomaa, Alexandru Popa

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

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 languageEnglish
Title of host publicationCombinatorial Algorithms - 25th International Workshop, IWOCA 2014, Revised Selected Papers
PublisherSpringer Verlag
Pages226-237
Number of pages12
Volume8986
ISBN (Print)9783319193144
DOIs
Publication statusPublished - 2015
Externally publishedYes
Event25th International Workshop on Combinatorial Algorithms, IWOCA 2014 - Duluth, United States
Duration: Oct 15 2014Oct 17 2014

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume8986
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other25th International Workshop on Combinatorial Algorithms, IWOCA 2014
CountryUnited States
CityDuluth
Period10/15/1410/17/14

Fingerprint

Coloring
Min-max
Colouring
Color
Q-integers
Wireless Mesh Networks
Wireless mesh networks (WMN)
Approximation algorithms
Exact Algorithms
Clique
Undirected Graph
Planar graph
Polynomial-time Algorithm
Approximation Algorithms
NP-complete problem
Optimal Solution
Polynomials
Graph in graph theory
Vertex of a graph

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Larjomaa, T., & Popa, A. (2015). 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

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, 2015. 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 proceedingConference contribution

Larjomaa, T & Popa, A 2015, 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, 25th International Workshop on Combinatorial Algorithms, IWOCA 2014, Duluth, United States, 10/15/14. https://doi.org/10.1007/978-3-319-19315-1_20
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. 2015. 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
Larjomaa, Tommi ; Popa, Alexandru. / The min-max Edge q-Coloring Problem. Combinatorial Algorithms - 25th International Workshop, IWOCA 2014, Revised Selected Papers. Vol. 8986 Springer Verlag, 2015. pp. 226-237 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{188518fb23ab4a8f9417f69ccf97bd81,
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 = "2015",
doi = "10.1007/978-3-319-19315-1_20",
language = "English",
isbn = "9783319193144",
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",

}

TY - GEN

T1 - The min-max Edge q-Coloring Problem

AU - Larjomaa, Tommi

AU - Popa, Alexandru

PY - 2015

Y1 - 2015

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

UR - http://www.scopus.com/inward/citedby.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

SN - 9783319193144

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

ER -