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

DOI10.1134/S1995423917010025zbMATH Open1374.68499OpenAlexW2591753903MaRDI QIDQ5269179

A. E. Galashov, A. V. Kel'manov

Publication date: 15 June 2017

Published in: Numerical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1995423917010025

zbMATH Keywords

clusteringEuclidean spaceNP-hard problemexact pseudopolynomial-time algorithmsubsets search

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

A discrete EOQ problem is solvable in \(O(\log n)\) time

This page was built for publication: Pseudopolynomial time solvability of a quadratic Euclidean problem of finding a family of disjoint subsets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5269179)