@inproceedings{a1eb21a68517426286b43328d60c1301,

title = "Location oblivious distributed unit disk graph coloring",

abstract = "We present the first location oblivious distributed unit disk graph coloring algorithm having a provable performance ratio of three (i.e. the number of colors used by the algorithm is at most three times the chromatic number of the graph). This is an improvement over the standard sequential coloring algorithm since we present a new lower bound of 10/3 for the worst-case performance ratio of the sequential coloring algorithm. The previous greatest lower bound on the performance ratio of the sequential coloring algorithm was 5/2. Using simulation, we also compare our algorithm with other existing unit disk graph coloring algorithms.",

keywords = "Approximation algorithms, Coloring, Distributed algorithms, Location oblivious algorithms, Unit disk graph",

author = "Mathieu Couture and Michel Barbeau and Prosenjit Bose and Paz Carmi and Evangelos Kranakis",

year = "2007",

month = jan,

day = "1",

doi = "10.1007/978-3-540-72951-8_18",

language = "English",

isbn = "9783540729181",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "222--233",

booktitle = "Structural Information and Communication Complexity - 14th International Colloquium, SIROCCO 2007, Proceedings",

address = "Germany",

note = "14th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2007 ; Conference date: 05-06-2007 Through 08-06-2007",

}