Optimal Discretization is Fixed-parameter Tractable

  title={Optimal Discretization is Fixed-parameter Tractable},
  author={Stefan Kratsch and Tom{\'a}{\vs} Masař{\'i}k and Irene Muzi and Marcin Pilipczuk and Manuel Sorge},
Given two disjoint sets $W_1$ and $W_2$ of points in the plane, the Optimal Discretization problem asks for the minimum size of a family of horizontal and vertical lines that separate $W_1$ from $W_2$, that is, in every region into which the lines partition the plane there are either only points of $W_1$, or only points of $W_2$, or the region is empty. Equivalently, Optimal Discretization can be phrased as a task of discretizing continuous variables: we would like to discretize the range of $x… Expand
1 Citations
Red-Blue Point Separation for Points on a Circle
A polynomial-time algorithm is demonstrated for the special case when the points lie on a circle and the W-hardness of a related problem in the axis-parallel setting, where the question is if there are p horizontal and q vertical lines that separate R from B. Expand


On the Parameterized Complexity of Red-Blue Points Separation
The problem is unlikely to be solvable significantly faster than the brute-force $n^{O(k)n^{o(k/ \log k)}$-time algorithm, where $n$ is the total number of points. Expand
The Parameterized Complexity of Stabbing Rectangles
It is proved that Rectangle Stabbing is W[1]-complete with respect to the parameter k, which means that there is no hope for an algorithm running in f(k)⋅|R∪L|O(1) time, and fixed-parameter tractability for the restrictions where the rectangles have bounded width or height or where each horizontal line intersects only a bounded number of rectangles is shown. Expand
Separating points by axis-parallel lines
This problem of separating n points in the plane, no two of which have the same x- or y-coordinate, is studied, and it is proved that this problem and some variants of it are APX-hard. Expand
Parameterized Algorithms
This comprehensive textbook presents a clean and coherent account of most fundamental tools and techniques in Parameterized Algorithms and is a self-contained guide to the area, providing a toolbox of algorithmic techniques. Expand
Improved Algorithms for Univariate Discretization of Continuous Features
It is demonstrated that a very simple Bayesian method performs better than ent-mdl as a model selection criterion for supervised discretization of a continuous variable. Expand
Tractability in constraint satisfaction problems: a survey
Although this work focuses on the classical CSP, it also covers its important extensions to infinite domains and optimisation, as well as #CSP and QCSP. Expand
Multi-Interval Discretization of Continuous-Valued Attributes for Classification Learning
This paper addresses the use of the entropy minimization heuristic for discretizing the range of a continuous-valued attribute into multiple intervals. Expand
Color Coding
These findings suggest that a reliable unidimensional hue code should not contain more than about tight optimally spaced stimuli, whereas color codes are valuable in decreasing search-time with locate-type tasks. Expand
Fine-grained complexity analysis of some combinatorial data science problems
This dissertation aims to provide a history of web exceptionalism from 1989 to 2002, a period chosen in order to explore its roots as well as specific cases up to and including the year in which descriptions of “Web 2.0” began to circulate. Expand
Polymorphisms, and How to Use Them
This article describes the algebraic approach to Constraint Satisfaction Problem that led to many developments in both CSP and universal algebra. No prior knowledge of universal algebra is assumed.