On dynamic combinatorial clustering
- Authors: Levin M.S.1
-
Affiliations:
- Institute for Information Transmission Problems
- Issue: Vol 62, No 6 (2017)
- Pages: 718-730
- Section: Information Technology in Engineering Systems
- URL: https://journals.rcsi.science/1064-2269/article/view/198541
- DOI: https://doi.org/10.1134/S1064226917060122
- ID: 198541
Cite item
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