Evaluating Steiner-tree heuristics and diameter variations for application layer multicast

DOI10.1016/J.COMNET.2008.06.003MaRDI QIDQ2377903zbMATH OpenOpenAlexFDO

Authors Knut-Helge Vik, Pål Halvorsen, Carsten Griwodz

Publication date 20 January 2009

Published in Computer Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.comnet.2008.06.003

zbMATH Keywords

distributed interactive applicationsoverlay multicastSteiner-tree heuristicstree-diameter

Mathematics Subject Classification ID

Distributed systems (68M14)

Recommendations

• scientific article; zbMATH DE number 1304096
• Computing and Combinatorics
• scientific article; zbMATH DE number 2242700
• A Distributed Primal-Dual Heuristic for Steiner Problems in Networks
• Neural and delay based heuristics for the Steiner problem in networks

Cited in

(3)

• CI-Rank: collective importance ranking for keyword search in databases
• The two-level diameter constrained spanning tree problem
• Parameterized approximations for the minimum diameter vertex-weighted Steiner tree problem in graphs with parameterized weights

This page was built for publication: Evaluating Steiner-tree heuristics and diameter variations for application layer multicast

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