DeepAI
Log In Sign Up

Euclidean 3D Stable Roommates is NP-hard

08/09/2021
by   Jiehua Chen, et al.
0

We establish NP-completeness for the Euclidean 3D Stable Roommates problem, which asks whether a given set V of 3n points from the Euclidean space can be partitioned into n disjoint (unordered) triples Π={V_1,…,V_n} such that Π is stable. Here, stability means that no three points x,y,z∈ V are blocking Π, and x,y,z∈ V are said to be blocking Π if the following is satisfied: – δ(x,y)+δ(x,z) < δ(x,x_1)+δ(x,x_2), – δ(y,x)+δ(y,z) < δ(y,y_1)+δ(y, y_2), and – δ(z,x)+δ(z,y) < δ(z,z_1)+δ(z,z_2), where {x,x_1,x_2}, {y,y_1,y_2}, {z,z_1,z_2}∈Π, and δ(a,b) denotes the Euclidean distance between a and b.

READ FULL TEXT

page 1

page 2

page 3

page 4

07/13/2017

How hard is it to satisfy (almost) all roommates?

The classical Stable Roommates problem (which is a non-bipartite general...
06/24/2021

Kemeny ranking is NP-hard for 2-dimensional Euclidean preferences

The assumption that voters' preferences share some common structure is a...
07/14/2020

Improved Paths to Stability for the Stable Marriage Problem

The stable marriage problem requires one to find a marriage with no bloc...
05/31/2018

Skyblocking: Learning Blocking Schemes on the Skyline

In this paper, for the first time, we introduce the concept of skyblocki...
12/04/2017

Clustering Stable Instances of Euclidean k-means

The Euclidean k-means problem is arguably the most widely-studied cluste...
01/14/2020

NP-completeness of slope-constrained drawing of complete graphs

We prove the NP-completeness of the following problem. Given a set S of ...
09/28/2021

On the Geometry of Stable Steiner Tree Instances

In this note we consider the Steiner tree problem under Bilu-Linial stab...