Abstract
We study the following geometric hypergraph coloring problem: given a planar point set and an integer k, we wish to color the points with k colors so that any axis-aligned strip containing sufficiently many points contains all colors. We show that if the strip contains at least 2k−1 points, such a coloring can always be found. In dimension d, we show that the same holds provided the strip contains at least k(4ln k + ln d) points.
We also consider the dual problem of coloring a given set of axis-aligned strips so that any sufficiently covered point in the plane is covered by k colors. We show that in dimension d the required coverage is at most d(k−1) + 1. Lower bounds are also given for all of the above problems. This complements recent impossibility results on decomposition of strip coverings with arbitrary orientations.
From the computational point of view, we show that deciding whether a three-dimensional point set can be 2-colored so that any strip containing at least three points contains both colors is NP-complete. This shows a big contrast with the planar case, for which this decision problem is easy.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Alon, N.: A simple algorithm for edge-coloring bipartite multigraphs. Inf. Proc. Lett. 85(6), 301–302 (2003)
Alon, N., Spencer, J.: The Probabilistic Method, 2nd edn. John Wiley, Chichester (2000)
Aloupis, G., Cardinal, J., Collette, S., Langerman, S., Orden, D., Ramos, P.: Decomposition of multiple coverings into more parts. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, SODA 2009 (2009)
Aloupis, G., Cardinal, J., Collette, S., Langerman, S., Smorodinsky, S.: Coloring geometric range spaces. Discrete & Computational Geometry 41(2), 348–362 (2009)
Alspach, B.: The wonderful walecki construction. Bull. Inst. Combin. Appl. 52, 7–20 (2008)
Buchsbaum, A., Efrat, A., Jain, S., Venkatasubramanian, S., Yi, K.: Restricted strip covering and the sensor cover problem. In: ACM-SIAM Symposium on Discrete Algorithms, SODA 2007 (2007)
Cole, R., Ost, K., Schirra, S.: Edge-coloring bipartite multigraphs in O(E log D) time. Combinatorica 21(1), 5–12 (2001)
Even, G., Lotker, Z., Ron, D., Smorodinsky, S.: Conflict-free colorings of simple geometric regions with applications to frequency assignment in cellular networks. SIAM Journal on Computing 33(1), 94–136 (2004)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)
Haxell, P., Szabó, T., Tardos, G.: Bounded size components: partitions and transversals. J. Comb. Theory Ser. B 88(2), 281–297 (2003)
Mani, P., Pach, J.: Decomposition problems for multiple coverings with unit balls (manuscript) (1986)
Moser, R.A.: A constructive proof of the lovász local lemma. In: Proc. of the ACM symposium on Theory of computing, New York, NY, USA, pp. 343–350 (2009)
Pach, J.: Decomposition of multiple packing and covering. In: 2. Kolloq. über Diskrete Geom., pp. 169–178. Inst. Math. Univ. Salzburg, Salzburg (1980)
Pach, J.: Decomposition of multiple packing and covering. In: 2. Kolloquium Uber Diskrete Geometrie, pp. 169–178. Inst. Math. Univ. Salzburg, Salzburg (1980)
Pach, J.: Covering the plane with convex polygons. Discrete & Computational Geometry 1, 73–81 (1986)
Pach, J., Tardos, G., Tóth, G.: Indecomposable coverings. In: Akiyama, J., Chen, W.Y.C., Kano, M., Li, X., Yu, Q. (eds.) CJCDGCGT 2005. LNCS, vol. 4381, pp. 135–148. Springer, Heidelberg (2007)
Pach, J., Tóth, G.: Decomposition of multiple coverings into many parts. In: Proc. of the ACM Symposium on Computational Geometry, pp. 133–137 (2007)
Smorodinsky, S.: On the chromatic number of some geometric hypergraphs. SIAM Journal on Discrete Mathematics 21(3), 676–687 (2007)
Stanton, R.G., Cowan, D.D., James, L.O.: Some results on path numbers. In: Louisiana Conference on Combin., Graph Theory and Computing (1970)
Tardos, G., Tóth, G.: Multiple coverings of the plane with triangles. Discrete & Computational Geometry 38(2), 443–450 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Aloupis, G. et al. (2010). Colorful Strips. In: López-Ortiz, A. (eds) LATIN 2010: Theoretical Informatics. LATIN 2010. Lecture Notes in Computer Science, vol 6034. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12200-2_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-12200-2_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12199-9
Online ISBN: 978-3-642-12200-2
eBook Packages: Computer ScienceComputer Science (R0)