The Euclidean k -matching problem is NP-hard

Journal of Automation and Intelligence · Elsevier

Аннотация

Publication date: December 2026 Source: Computational Geometry, Volume 135 Author(s): José-Miguel Díaz-Báñez, Ruy Fabila-Monroy, José-Manuel Higes-López, Nestaly Marín, Miguel-Angel Pérez-Cutiño, Pablo Pérez-Lantero

Читать у издателя →

Похожие статьи