Abstract
Given an integer k ≥ 2, we consider the problem of computing the smallest real number t(k) such that for each set P of points in the plane, there exists a t(k)-spanner for P that has chromatic number at most k. We prove that t(2) = 3, t(3) = 2, \(t(4) = \sqrt{2}\), and give upper and lower bounds on t(k) for k > 4. We also show that for any ε> 0, there exists a (1 + ε)t(k)-spanner for P that has O(|P|) edges and chromatic number at most k. Finally, we consider an on-line variant of the problem where the points of P are given one after another, and the color of a point must be assigned at the moment the point is given. In this setting, we prove that t(2) = 3, \(t(3) = 1+ \sqrt{3}\), \(t(4) = 1+ \sqrt{2}\), and give upper and lower bounds on t(k) for k > 4.
Research partially supported by HPCVL, NSERC, MRI, CFI, and MITACS.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bose, P., Carmi, P., Couture, M., Maheshwari, A., Smid, M., Zeh, N.: Geometric spanners with small chromatic number. Technical Report 0711.0114v1 (2007), http://arxiv.org/abs/0711.0114v1
Bose, P., Gudmundsson, J., Morin, P.: Ordered theta graphs. Comput. Geom. Theory Appl. 28(1), 11–18 (2004)
Callahan, P.B., Kosaraju, S.R.: A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields. Journal of the ACM 42, 67–90 (1995)
Grötzsch, H.: Ein Dreifarbensatz für dreikreisfreie Netze auf der Kugel. Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg Math.-Natur. Reihe 8, 109–120 (1959)
Gudmundsson, J., Levcopoulos, C., Narasimhan, G., Smid, M.: Approximate distance oracles for geometric graphs. In: Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms, pp. 828–837 (2002)
Narasimhan, G., Smid, M.: Geometric Spanner Networks. Cambridge University Press, New York (2007)
Raman, B., Chebrolu, K.: Design and evaluation of a new mac protocol for long-distance 802.11 mesh networks. In: MobiCom 2005, pp. 156–169. ACM Press, New York (2005)
Thomassen, C.: A short list color proof of Grotzsch’s theorem. Journal of Combinatorial Theory B 88, 189–192 (2003)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bose, P., Carmi, P., Couture, M., Maheshwari, A., Smid, M., Zeh, N. (2008). Geometric Spanners with Small Chromatic Number. In: Kaklamanis, C., Skutella, M. (eds) Approximation and Online Algorithms. WAOA 2007. Lecture Notes in Computer Science, vol 4927. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77918-6_7
Download citation
DOI: https://doi.org/10.1007/978-3-540-77918-6_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77917-9
Online ISBN: 978-3-540-77918-6
eBook Packages: Computer ScienceComputer Science (R0)