Pseudopolynomial time solvability of a quadratic Euclidean problem of finding a family of disjoint subsets

Research output: Contribution to journal › Article › peer-review

Original language	English
Pages (from-to)	11-16
Number of pages	6
Journal	Numerical Analysis and Applications
Volume	10
Issue number	1
DOIs	https://doi.org/10.1134/S1995423917010025
Publication status	Published - 1 Jan 2017

clustering, Euclidean space, exact pseudopolynomial time algorithm, NP-hard problem, subsets search

ID: 9056388