×

Local construction and coloring of spanners of location aware unit disk graphs. (English) Zbl 1194.05046

Summary: We look at the problem of coloring locally specially constructed spanners of unit disk graphs. First we present a local approximation algorithm for the vertex coloring problem in Unit Disk Graphs (UDGs) which uses at most four times as many colors as an optimal solution requires. Next we look at the colorability of spanners of UDGs. In particular we present a local algorithm for constructing a 4-colorable spanner of a unit disk graph. The output consists of the spanner and the 4-coloring. The computed spanner also has the properties that it is planar, the degree of a vertex in the spanner is at most 5 and the angles between two edges are at least \(\pi /3\). By enlarging the locality distance (i.e. the size of the neighborhood which a vertex has to explore in order to compute its color) we can ensure the total weight of the spanner to be arbitrarily close to the weight of a minimum spanning tree.
We prove that a local algorithm cannot compute a bipartite spanner of a unit disk graph and therefore our algorithm needs at most one color more than any local algorithm for the task requires. Moreover, we prove that there is no local algorithm for 3-coloring UDGs or spanners of UDGs, even if the 3-colorability of the graph (or the spanner respectively) is guaranteed in advance.

MSC:

05C15 Coloring of graphs and hypergraphs
05C85 Graph algorithms (graph-theoretic aspects)
68W25 Approximation algorithms
68W15 Distributed algorithms
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] DOI: 10.1016/0012-365X(76)90147-3 · Zbl 0339.05109
[2] P. Bose, J. Gudmundsson and M. H. M. Smid, ESA, LNCS 2461, eds. Rolf H. Möhring and Rajeev Raman (Springer, 2002) pp. 234–246.
[3] DOI: 10.1023/A:1012319418150 · Zbl 0996.68012
[4] E. Chávez, LATIN, LNCS 3887, eds. José R. Correa, Alejandro Hevia and Marcos A. Kiwi (Springer, 2006) pp. 286–297.
[5] DOI: 10.1016/0012-365X(90)90358-O · Zbl 0739.05079
[6] DOI: 10.1016/B978-044482537-7/50010-3
[7] DOI: 10.2307/2412323
[8] DOI: 10.1007/PL00009196 · Zbl 0901.68152
[9] DOI: 10.1137/0221015 · Zbl 0787.05058
[10] Li X.-Y., IEEE Trans. Parall. Distr. Syst. 15 pp 1057–
[11] DOI: 10.1145/185675.306789 · Zbl 0814.68064
[12] DOI: 10.1002/net.3230250205 · Zbl 0821.90128
[13] DOI: 10.1137/S0097539799361671 · Zbl 0966.68205
[14] DOI: 10.1016/j.jda.2006.05.004 · Zbl 1130.05059
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.