On the Minimum Consistent Subset Problem

by   Ahmad Biniaz, et al.

Let P be a set of n colored points in the plane. Introduced by Hart (1968), a consistent subset of P, is a set S⊆ P such that for every point p in P∖ S, the closest point of p in S has the same color as p. The consistent subset problem is to find a consistent subset of P with minimum cardinality. This problem is known to be NP-complete even for two-colored point sets. Since the initial presentation of this problem, aside from the hardness results, there has not been a significant progress from the algorithmic point of view. In this paper we present the following algorithmic results: 1. The first subexponential-time algorithm for the consistent subset problem. 2. An O(n n)-time algorithm that finds a consistent subset of size two in two-colored point sets (if such a subset exists). Towards our proof of this running time we present a deterministic O(n n)-time algorithm for computing a variant of the compact Voronoi diagram; this improves the previously claimed expected running time. 3. An O(n^2 n)-time algorithm that finds a minimum consistent subset in two-colored point sets where one color class contains exactly one point; this improves the previous best known O(n^2) running time which is due to Wilfong (SoCG 1991). 4. An O(n)-time algorithm for the consistent subset problem on collinear points; this improves the previous best known O(n^2) running time. 5. A non-trivial O(n^6)-time dynamic programming algorithm for the consistent subset problem on points arranged on two parallel lines. To obtain these results, we combine tools from planar separators, additively-weighted Voronoi diagrams with respect to convex distance functions, point location in farthest-point Voronoi diagrams, range trees, paraboloid lifting, minimum covering of a circle with arcs, and several geometric transformations.


page 1

page 2

page 3

page 4


Some results on Minimum Consistent Subsets of Trees

For a graph G = (V,E) where each vertex is coloured by one of k colours,...

Point Separation and Obstacle Removal by Finding and Hitting Odd Cycles

Suppose we are given a pair of points s, t and a set S of n geometric ob...

Minimum Consistent Subset for Trees Revisited

In a vertex-colored graph G = (V, E), a subset S ⊆ V is said to be consi...

Fast and Exact Convex Hull Simplification

Given a point set P in the plane, we seek a subset Q⊆ P, whose convex hu...

Faster Algorithms for some Optimization Problems on Collinear Points

We propose faster algorithms for the following three optimization proble...

Rectilinear Steiner Trees in Narrow Strips

A rectilinear Steiner tree for a set P of points in ℝ^2 is a tree that c...

Euclidean TSP in Narrow Strip

We investigate how the complexity of Euclidean TSP for point sets P insi...

Please sign up or login with your details

Forgot password? Click here to reset