The cardinality-constrained paths problem: Multicast data routing in heterogeneous communication networks
Alvaro Velasquez, Piotr Jerzy Wojciechowski, K. Subramani, Steven Drager, Sumit Kumar Jha · 2016
In this paper, we present two new problems and a theoretical framework that can be used to route information in heterogeneous communication networks. These problems are the cardinality-constrained and interval-constrained paths problems and they consist of finding paths in a network such that cardinality constraints on the number of nodes belonging to different sets of labels are satisfied. We propose a novel algorithm for finding said paths and demonstrate the effectiveness of our approach on networks of various sizes.