Pablo P'erez-Lantero

collaborators

3 papers

cs.CG2025

The Euclidean $k$ -Matching Problem is NP-hard

JosÃ©-Miguel DÃaz-BÃ¡Ã±ez, Ruy Fabila-Monroy, JosÃ©-Manuel Higes-LÃ³pez +3

Let $G$ be a complete edge-weighted graph on $n$ vertices. To each subset of vertices of $G$ assign the cost of the minimum spanning tree of the subset as its weight. Suppose that…

cs.CG2025

On maximum-sum matchings of bichromatic points

Oscar ChacÃ³n-Rivera, Pablo PÃ©rez-Lantero

Huemer et al. (Discrete Math, 2019) proved that for any two finite point sets $R$ and $B$ in the plane with $∣ R ∣ = ∣ B ∣$ , the perfect matching that matches points of $R$ with points…

cs.CG2025

Matching random colored points with rectangles (Corrigendum)

Given $n > 0$ , let $S \subset [0, 1]^{2}$ be a set of $n$ points, chosen uniformly at random. Let $R \cup B$ be a random partition, or coloring, of $S$ in which each point of $S$ is inclu…

The Euclidean k-Matching Problem is NP-hard

On maximum-sum matchings of bichromatic points

Matching random colored points with rectangles (Corrigendum)

The Euclidean $k$ -Matching Problem is NP-hard