On dynamic combinatorial clustering


Cite item

Full Text

Open Access Open Access
Restricted Access Access granted
Restricted Access Subscription Access

Abstract

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).

About the authors

M. Sh. Levin

Institute for Information Transmission Problems

Author for correspondence.
Email: hslevin04@yahoo.com
Russian Federation, Moscow


Copyright (c) 2017 Pleiades Publishing, Inc.

This website uses cookies

You consent to our cookies if you continue to use our website.

About Cookies