On the performance and feasibility of multicast core selection heuristics

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0037(200003)35:2<145::AID-NET5>3.0.CO;2-M" /><145::AID-NET5>3.0.CO;2-M 10.1002/(SICI)1097-0037(200003)35:2<145::AID-NET5>3.0.CO;2-MzbMath0957.90015OpenAlexW1985889970MaRDI QIDQ4953324

No author found.

Publication date: 2 April 2001

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(200003)35:2<145::aid-net5>3.0.co;2-m

zbMATH Keywords

multicast communicationcore nodegraph centercore migrationmultipoint connection

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic network models in operations research (90B10)

Related Items (1)

Distributed reformation of core-based group-shared multicast trees in mobile ad hoc networks

Cites Work

• Unnamed Item

This page was built for publication: On the performance and feasibility of multicast core selection heuristics