Abstract
In this paper, we study the Shortest Color Spanning Intervals problem, and related generalizations, namely Smallest Color Spanning \(t\) Squares and Smallest Color Spanning \(t\) Circles. The generic setting is the following: we are given n points in the plane (or on the line), each colored with one of k colors, and for each color i we also have a demand \(s_i\). Given a budget t, we are required to find at most t objects (for example, intervals, squares, circles, etc.) that cover at least \(s_i\) points of color i. Typically, the goal is to minimize the maximum perimeter or area.
We provide exact algorithms for these problems for the cases of intervals, circles and squares, generalizing several known results. In the case of intervals, we provide a comprehensive understanding of the complexity landscape of the problem after taking several natural parameters into account. Given that the problem turns out to be W[1]-hard parameterized by the standard parameters, we introduce a new parameter, namely sparsity, and prove new hardness and tractability results in this context. For squares and circles, we use existing algorithms of one smallest color spanning object in order to design algorithms for getting t identical objects of minimum size whose union spans all the colors.
S. Banerjee—The work was done while the author was visiting the Indian Institute of Science, Bangalore, India.
N. Misra—The author is supported by the DST-INSPIRE fellowship, project DSTO-1209.
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 subscriptionsReferences
Abellanas, M., Hurtado, F., Icking, C., Klein, R., Langetepe, E., Ma, L., Palop, B., Sacristán, V.: The farthest color voronoi diagram and related problems. Technical report (2006)
Abellanas, M., Hurtado, F., Icking, C., Klein, R., Langetepe, E., Ma, L., Palop, B., Sacristán, V.: Smallest color-spanning objects. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol. 2161, pp. 278–289. Springer, Heidelberg (2001)
Abu-Khzam, F.N.: A kernelization algorithm for d-hitting set. J. Comput. Syst. Sci. 76(7), 524–531 (2010)
Chen, D., Misiolek, E.: Algorithms for interval structures with applications. Theor. Comput. Sci. 508, 41–53 (2013)
Das, S., Goswami, P.P., Nandy, S.C.: Smallest color spanning objects revisited. Int. J. Comput. Geom. Appl. 19, 457–478 (2009)
Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, New York (1999)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)
Huttenlocher, D.P., Kedem, K., Sharir, M.: The upper envelope of voronoi surfaces and its applications. Discrete Comput. Geom. 9, 267–291 (1993)
Jiang, M., Wang, H.: Shortest color spanning intervals. Theoretical Computer Sci. (2015, in Press)
Khanteimouri, P., Mohades, A., Abam, M.A., Kazemi, M.R.: Computing the smallest color-spanning axis-parallel square. In: Cai, L., Cheng, S.-W., Lam, T.-W. (eds.) Algorithms and Computation. LNCS, vol. 8283, pp. 634–643. Springer, Heidelberg (2013)
Khanteimouri, P., Mohades, A., Abam, M., Kazemi, M.: Spanning colored points with intervals. In: Proceedings of the 25th Canadian Conference on Computational Geometry (CCCG), pp. 265–270 (2013)
Dom, M., Lokshtanov, D., Saurabh, S.: Incompressibility through colors and IDs. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part I. LNCS, vol. 5555, pp. 378–389. Springer, Heidelberg (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Banerjee, S., Misra, N., Nandy, S.C. (2016). Color Spanning Objects: Algorithms and Hardness Results. In: Govindarajan, S., Maheshwari, A. (eds) Algorithms and Discrete Applied Mathematics. CALDAM 2016. Lecture Notes in Computer Science(), vol 9602. Springer, Cham. https://doi.org/10.1007/978-3-319-29221-2_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-29221-2_4
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-29220-5
Online ISBN: 978-3-319-29221-2
eBook Packages: Computer ScienceComputer Science (R0)