Optimal broadcasting with universal lists based on competitive analysis*

DOI10.1002/NET.20068MaRDI QIDQ5463674zbMATH OpenOpenAlexFDO

Authors Kyung-Yong Chwa, Jae-Hoon Kim

Publication date 5 August 2005

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.20068

zbMATH Keywords

broadcastingcompetitive analysiscomplete graphgridhypercubetree

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• Broadcasting with universal lists revisited: Using competitive analysis
• Broadcasting with universal lists
• Line broadcasting in cycles
• scientific article; zbMATH DE number 2068168
• An optimal algorithm for broadcasting multiple messages in trees

Cites work

• scientific article; zbMATH DE number 1118889 (Why is no real title available?)
• Online algorithms. The state of the art

Cited in

(7)

• Nonadaptive broadcasting in trees
• Broadcasting with universal lists revisited: Using competitive analysis
• Time and energy optimal list ranking algorithms on the k-channel broadcast communication model
• Broadcasting with universal lists
• A note to non-adaptive broadcasting
• Finding broadcast 2-centers of a tree under the postal model
• Source-oblivious broadcast

This page was built for publication: Optimal broadcasting with universal lists based on competitive analysis*

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5463674)