The min-max Edge q-Coloring Problem

Tommi Larjomaa, Alexandru Popa

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

2 Citations (Scopus)


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
EditorsDalibor Froncek, Jan Kratochvíl, Mirka Miller
PublisherSpringer Verlag
Number of pages12
ISBN (Electronic)9783319193144
Publication statusPublished - 2015
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)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Other25th International Workshop on Combinatorial Algorithms, IWOCA 2014
CountryUnited States

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

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

Cite this