Document

# On the Parameterized Complexity of Red-Blue Points Separation

## File

LIPIcs.IPEC.2017.8.pdf
• Filesize: 0.56 MB
• 13 pages

## Cite As

Édouard Bonnet, Panos Giannopoulos, and Michael Lampis. On the Parameterized Complexity of Red-Blue Points Separation. In 12th International Symposium on Parameterized and Exact Computation (IPEC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 89, pp. 8:1-8:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
https://doi.org/10.4230/LIPIcs.IPEC.2017.8

## Abstract

We study the following geometric separation problem: Given a set R of red points and a set B of blue points in the plane, find a minimum-size set of lines that separate R from B. We show that, in its full generality, parameterized by the number of lines k in the solution, the problem is unlikely to be solvable significantly faster than the brute-force n^{O(k)}-time algorithm, where n is the total number of points. Indeed, we show that an algorithm running in time f(k)n^{o(k/log k)}, for any computable function f, would disprove ETH. Our reduction crucially relies on selecting lines from a set with a large number of different slopes (i.e., this number is not a function of k). Conjecturing that the problem variant where the lines are required to be axis-parallel is FPT in the number of lines, we show the following preliminary result. Separating R from B with a minimum-size set of axis-parallel lines is FPT in the size of either set, and can be solved in time O^*(9^{|B|}) (assuming that B is the smallest set).
##### Keywords
• red-blue points separation
• geometric problem
• W[1]-hardness
• FPT algorithm
• ETH-based lower bound

## Metrics

• Access Statistics
• Total Accesses (updated on a weekly basis)
0

## References

1. Édouard Bonnet and Tillmann Miltzow. Parameterized hardness of art gallery problems. In Piotr Sankowski and Christos D. Zaroliagis, editors, 24th Annual European Symposium on Algorithms, ESA 2016, August 22-24, 2016, Aarhus, Denmark, volume 57 of LIPIcs, pages 19:1-19:17. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016. URL: http://dx.doi.org/10.4230/LIPIcs.ESA.2016.19.
2. G. Calinescu, A. Dumitrescu, H.J. Karloff, and P. Wan. Separating points by axis-parallel lines. Int. J. Comput. Geometry Appl., 15(6):575-590, 2005.
3. O. Devillers, F. Hurtado, M. Mora, and C. Seara. Separating several point sets in the plane. In Proc. of the 13th Canad. Conf. Comput. Geom., pages 81-84, 2001.
4. U.M. Fayyad and K.B. Irani. Multi-interval discretization of continuous-valued attributes for classification learning. In Proc. of 13th Int. Joint Conf. on Artificial Intelligence, pages 1022-1029, 1993.
5. R. Freimer, J.S.B. Mitchell, and C.D. Piatko. On the complexity of shattering using arrangements. TR 91-1197, Dept. Comput. Sci., Cornell Univ., NY, 1991.
6. S. Har-Peled and M. Jones. On separating points by lines. arXiv:1706.02004v1, 2017.
7. Ferran Hurtado, Mercè Mora, Pedro A. Ramos, and Carlos Seara. Separability by two lines and by nearly straight polygonal chains. Discrete Applied Mathematics, 144(1-2):110-122, 2004. URL: http://dx.doi.org/10.1016/j.dam.2003.11.014.
8. J. Kujala and T. Elomaa. Improved algorithms for univariate discretization of continuous features. In Proc. of the 11th PKDD, volume 4702 of LNCS, pages 188-199, 2007.
9. B. Lu, H. Du, X. Jia, Y. Xu, and B. Zhu. On a minimum linear classification problem. J. of Global Optimization, 35(1):103-109, 2006.
10. N. Megiddo. On the complexity of polyhedral separability. Discr. &Comput. Geom, 3:325-337, 1988.
X

Feedback for Dagstuhl Publishing