Grid intersection graphs and boxicity
Discrete Mathematics - Special issue on combinatorics and algorithms
Complexity of the forwarding index problem
SIAM Journal on Discrete Mathematics
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
A special planar satisfiability problem and a consequence of its NP-completeness
Discrete Applied Mathematics
Synchronized data distribution management in distributed simulations
PADS '98 Proceedings of the twelfth workshop on Parallel and distributed simulation
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Parallel and Distribution Simulation Systems
Parallel and Distribution Simulation Systems
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Proceedings of the Third International COST264 Workshop on Networked Group Communication
NGC '01 Proceedings of the Third International COST264 Workshop on Networked Group Communication
QoS Routing Protocol for the Generalized Multicast Routing Problem (GMRP)
ICN '01 Proceedings of the First International Conference on Networking-Part 1
VRAIS '95 Proceedings of the Virtual Reality Annual International Symposium (VRAIS'95)
Graphs and Hypergraphs
QMBF: a QoS-aware multicast routing protocol
Computer Communications
A survey of data multicast techniques, architectures, and algorithms
IEEE Communications Magazine
Guest Editorial Network Support for Multipoint Communication
IEEE Journal on Selected Areas in Communications
Distributed center-location algorithms
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
We consider real-time communications required by a Distributed Interactive Simulation (DIS), using multipoint communication technics. We focus here on a classical interactive game between participants distributed on a geographic map, where each participant is associated to a square cell on it. The needs of communication between participants are represented by a graph. The problem we consider consists in covering efficiently this graph by groups of nodes, and in allocating in the target network a subtree with a given bandwidth to each group. The problem is proved NP-complete. Lower bounds, and two heuristics with their analysis are provided.