On dynamic combinatorial clustering


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

The paper addresses dynamic combinatorial clustering. First, a systematic literature survey on dynamic/online clustering is presented (problems, methods, applications). Second, restructuring approach to clustering is described (one-stage clustering, multi-stage clustering, sorting). Third, two network application examples of dynamic/multistage clustering are examined: (a) multi-stage connection of users to access points, (b) partition coloring problem in optical networks (wavelength routing and assignment).

作者简介

M. Levin

Institute for Information Transmission Problems

编辑信件的主要联系方式.
Email: hslevin04@yahoo.com
俄罗斯联邦, Moscow


版权所有 © Pleiades Publishing, Inc., 2017
##common.cookie##