Polynomial-Time Solvability of the One-Dimensional Case of an NP-Hard Clustering Problem

A. V. Kel’manov, V. I. Khandeev

Research output: Contribution to journalArticlepeer-review

Fingerprint

Dive into the research topics of 'Polynomial-Time Solvability of the One-Dimensional Case of an NP-Hard Clustering Problem'. Together they form a unique fingerprint.

Mathematics