Abstract
Given a set of n points P in the plane, each colored with one of the t given colors, a color-spanning set \(S\subset P\) is a subset of t points with distinct colors. The minimum diameter color-spanning set (MDCS) is a color-spanning set whose diameter is minimum (among all color-spanning sets of P). Somehow symmetrically, the largest closest pair color-spanning set (LCPCS) is a color-spanning set whose closest pair is the largest (among all color-spanning sets of P). Both MDCS and LCPCS have been shown to be NP-complete, but whether they are fixed-parameter tractable (FPT) when t is a parameter are still open. (Formally, the problem whether MDCS is FPT was posed by Fleischer and Xu in 2010.) Motivated by this question, we consider the FPT tractability of some matching problems under this color-spanning model, where \(t=2k\) is the parameter. The results are summarized as follows: (1) MinSum Matching Color-Spanning Set, namely, computing a matching of 2k points with distinct colors such that their total edge length is minimized, is FPT; (2) MaxMin Matching Color-Spanning Set, namely, computing a matching of 2k points with distinct colors such that the minimum edge length is maximized, is FPT; (3) MinMax Matching Color-Spanning Set, namely, computing a matching of 2k points with distinct colors such that the maximum edge length is minimized, is FPT; and (4) k-Multicolored Independent Matching, namely, computing a matching of 2k vertices in a graph such that the vertices of the edges in the matching do not share common edges in the graph, is W[1]-hard. With (2), we show that LCPCS is in fact FPT.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Abellanas, M., Hurtado, F., Icking, C., Klein, R., Langetepe, E., Ma, L., Palop, B., Sacristán, V.: Smallest color-spanning objects. In: Heide, F.M. (ed.) ESA 2001. LNCS, vol. 2161, pp. 278–289. Springer, Heidelberg (2001). doi:10.1007/3-540-44676-1_23
Chen, Y., Shen, S., Gu, Y., Hui, M., Li, F., Liu, C., Liu, L., Ooi, B.C., Yang, X., Zhang, D., Zhou, Y.: MarcoPolo: a community system for sharing and integrating travel information on maps. In: Proceedings of the 12th International Conference on Extending Database Technology (EDBT 2009), pp. 1148–1151 (2009)
Downey, R., Fellows, M.: Parameterized Complexity. Springer, New York (1999)
Fan, C., Luo, J., Wang, W., Zhong, F., Zhu, B.: On some proximity problems of colored sets. J. Comput. Sci. Technol. 29(5), 879–886 (2014)
Fellows, M., Hermelin, D., Rosamond, F., Vialette, S.: On the parameterized complexity of multiple-interval graph problems. Theoret. Comput. Sci. 410(1), 53–61 (2009)
Fleischer, R., Xu, X.: Computing minimum diameter color-spanning sets. In: Lee, D.-T., Chen, D.Z., Ying, S. (eds.) FAW 2010. LNCS, vol. 6213, pp. 285–292. Springer, Heidelberg (2010). doi:10.1007/978-3-642-14553-7_27
Fleischer, R., Xu, X.: Computing minimum diameter color-spanning sets is hard. Info. Process. Lett. 111(21–22), 1054–1056 (2011)
Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, Berlin (2006)
Ju, W., Fan, C., Luo, J., Zhu, B., Daescu, O.: On some geometric problems of color-spanning sets. J. Comb. Optim. 26(2), 266–283 (2013)
Moser, H., Sikdar, S.: The parameterized complexity of the induced matching problem. Discret. Appl. Math. 157(4), 715–727 (2009)
Moser, H., Thilikos, D.: Parameterized complexity of finding regular induced subgraphs. J. Discret. Algorithms 7(2), 181–190 (2009)
Ma, F., Gao, X., Yin, M., Pan, L., Jin, J., Liu, H., Zhang, J.: Optimizing shortwave radio broadcast resource allocation via pseudo-boolean constraint solving and local search. In: Rueher, M. (ed.) CP 2016. LNCS, vol. 9892, pp. 650–665. Springer, Cham (2016). doi:10.1007/978-3-319-44953-1_41
Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction. Springer, New York (1985)
Zhang, D., Chee, Y.M., Mondal, A., Tung, A.K.H., Kitsuregawa, M.: Keyword search in spatial databases: towards searching by document. In: Proceedings of the 25th IEEE International Conference on Data Engineering (ICDE 2009), pp. 688–699 (2009)
Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. Theory Comput. 3(1), 103–128 (2007)
Acknowledgments
This research is partially supported by NSF of China under project 61628207. We also thank Ge Cunjing for pointing out some relevant reference.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Bereg, S., Ma, F., Wang, W., Zhang, J., Zhu, B. (2017). On the Fixed-Parameter Tractability of Some Matching Problems Under the Color-Spanning Model. In: Xiao, M., Rosamond, F. (eds) Frontiers in Algorithmics. FAW 2017. Lecture Notes in Computer Science(), vol 10336. Springer, Cham. https://doi.org/10.1007/978-3-319-59605-1_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-59605-1_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-59604-4
Online ISBN: 978-3-319-59605-1
eBook Packages: Computer ScienceComputer Science (R0)