Biclique completion problems for multicast network design

Nathalie Faure Philippe Chrétienne 1 Eric Gourdin Francis Sourd 1
1 RO - Recherche Opérationnelle
LIP6 - Laboratoire d'Informatique de Paris 6
Abstract : This paper considers the problem of aggregating several multicast sessions. A multicast session is defined as a subset of clients requiring the same information. Besides, each client can require several multicast sessions. A telecommunication network cannot manage many multicast sessions at the same time. It is hence necessary to group the sessions into a limited number of clusters. The problem then consists in aggregating the sessions into clusters to limit the number of unnecessary information sent to clients. The strong relationship of the problems with biclique problems in bipartite graph is established. We then model the problems using integer quadratic and linear programming formulations. We investigate some properties to strengthen the models. Several algorithms are provided and compared with a series of numerical experiments.
Document type :
Journal articles
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01185215
Contributor : Lip6 Publications <>
Submitted on : Wednesday, August 19, 2015 - 2:21:00 PM
Last modification on : Thursday, December 13, 2018 - 1:27:11 AM

Links full text

Identifiers

Collections

Citation

Nathalie Faure, Philippe Chrétienne, Eric Gourdin, Francis Sourd. Biclique completion problems for multicast network design. Discrete Optimization, Elsevier, 2007, 4 (3-4), pp.360-377. ⟨10.1016/j.disopt.2007.09.005⟩. ⟨hal-01185215⟩

Share

Metrics

Record views

58