The Min-max Edge q-Coloring Problem

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F15%3A00087418" target="_blank" >RIV/00216224:14330/15:00087418 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/978-3-319-19315-1_20" target="_blank" >http://dx.doi.org/10.1007/978-3-319-19315-1_20</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-319-19315-1_20" target="_blank" >10.1007/978-3-319-19315-1_20</a>

Result language
angličtina
Original language name
The Min-max Edge q-Coloring Problem
Original language description
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.
Czech name
—
Czech description
—

Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2015
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
25th International Workshop, IWOCA 2014, LNCS 8986
ISBN
9783319193144
ISSN
0302-9743
e-ISSN
—
Number of pages
12
Pages from-to
226-237
Publisher name
Springer
Place of publication
Duluth, MN, USA
Event location
Duluth, MN, USA
Event date
Jan 1, 2015
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)