首页 | 本学科首页   官方微博 | 高级检索  
     检索      


On Polynomial Solvability of One Quadratic Euclidean Clustering Problem on a Line
Authors:Kel’manov  A V  Khandeev  V I
Institution:1.Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences, 630090, Novosibirsk, Russia
;2.Novosibirsk State University, 630090, Novosibirsk, Russia
;
Abstract:Doklady Mathematics - We consider the problem of partitioning a finite set of points in Euclidean space into clusters so as to minimize the sum, over all clusters, of the intracluster sums of the...
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号