Další formáty:
BibTeX
LaTeX
RIS
@inproceedings{1344370, author = {Larjomaa, Tommi and Popa, Alexandru}, address = {Duluth, MN, USA}, booktitle = {25th International Workshop, IWOCA 2014, LNCS 8986}, doi = {http://dx.doi.org/10.1007/978-3-319-19315-1_20}, keywords = {Algorithms; Color; Combinatorial mathematics; Graph theory; MESH networking; Polynomial approximation; Trees (mathematics)}, howpublished = {tištěná verze "print"}, language = {eng}, location = {Duluth, MN, USA}, isbn = {978-3-319-19314-4}, pages = {226-237}, publisher = {Springer}, title = {The Min-max Edge q-Coloring Problem}, year = {2015} }
TY - JOUR ID - 1344370 AU - Larjomaa, Tommi - Popa, Alexandru PY - 2015 TI - The Min-max Edge q-Coloring Problem PB - Springer CY - Duluth, MN, USA SN - 9783319193144 KW - Algorithms KW - Color KW - Combinatorial mathematics KW - Graph theory KW - MESH networking KW - Polynomial approximation KW - Trees (mathematics) 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. ER -
LARJOMAA, Tommi a Alexandru POPA. The Min-max Edge q-Coloring Problem. In \textit{25th International Workshop, IWOCA 2014, LNCS 8986}. Duluth, MN, USA: Springer, 2015, s.~226-237. ISBN~978-3-319-19314-4. Dostupné z: https://dx.doi.org/10.1007/978-3-319-19315-1\_{}20.
|