Constrained Content Distribution and Communication Scheduling for Several Restricted Classes of Graphs
Mugurel Ionuţ Andreica, Nicolae Ţăpuş · 2008
In this paper we address several problems regarding content distribution (broadcast) and communication optimization and scheduling for some restricted classes of graphs (trees, intersecting cliques). For the broadcast problem in trees we introduce some new extensions and present some new algorithmic results for determining optimal offline broadcast strategies. The communication scheduling problems are also addressed from an offline algorithmic perspective, considering mutual exclusion constraints or geometric aspects.