Heuristic algorithms for the min-max edge 2-coloring problem

Radu Stefan Mincu, Alexandru Popa

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

Abstract

In multi-channel Wireless Mesh Networks (WMN), each node is able to use multiple non-overlapping frequency channels. Raniwala et al. (MC2R 2004, INFOCOM 2005) propose and study several such architectures in which a computer can have multiple network interface cards. These architectures are modeled as a graph problem named maximum edge q-coloring and studied in several papers by Feng et. al (TAMC 2007), Adamaszek and Popa (ISAAC 2010, JDA 2016). Later on Larjomaa and Popa (IWOCA 2014, JGAA 2015) define and study an alternative variant, named the min-max edge q-coloring. The above mentioned graph problems, namely the maximum edge q-coloring and the min-max edge q-coloring are studied mainly from the theoretical perspective. In this paper, we study the min-max edge 2-coloring problem from a practical perspective. More precisely, we introduce, implement and test four heuristic approximation algorithms for the min-max edge 2-coloring problem. These algorithms are based on a Breadth First Search (BFS)-based heuristic and on local search methods like basic hill climbing, simulated annealing and tabu search techniques, respectively. Although several algorithms for particular graph classes were proposed by Larjomaa and Popa (e.g., trees, planar graphs, cliques, bi-cliques, hypergraphs), we design the first algorithms for general graphs. We study and compare the running data for all algorithms on Unit Disk Graphs, as well as some graphs from the DIMACS vertex coloring benchmark dataset.

Original languageEnglish
Title of host publicationComputing and Combinatorics - 24th International Conference, COCOON 2018, Proceedings
EditorsDaming Zhu, Lusheng Wang
PublisherSpringer Verlag
Pages662-674
Number of pages13
ISBN (Print)9783319947754
DOIs
Publication statusPublished - Jan 1 2018
Event24th International Conference on Computing and Combinatorics Conference, COCOON 2018 - Qing Dao, China
Duration: Jul 2 2018Jul 4 2018

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10976 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other24th International Conference on Computing and Combinatorics Conference, COCOON 2018
CountryChina
CityQing Dao
Period7/2/187/4/18

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Heuristic algorithms for the min-max edge 2-coloring problem'. Together they form a unique fingerprint.

  • Cite this

    Mincu, R. S., & Popa, A. (2018). Heuristic algorithms for the min-max edge 2-coloring problem. In D. Zhu, & L. Wang (Eds.), Computing and Combinatorics - 24th International Conference, COCOON 2018, Proceedings (pp. 662-674). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10976 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-94776-1_55