THE EFFECT OF ASYMMETRY ON THE ON-LINE MULTICAST ROUTING PROBLEM

DOI10.1142/S0129054102001527zbMath1067.68015MaRDI QIDQ3021994

Michalis Faloutsos, Rajesh K. Pankaj, K. C. Sevcik

Publication date: 22 June 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

directed graphsSteiner treesmulticast routingon-line

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (4)

Online Priority Steiner Tree Problems ⋮ A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry ⋮ The Bursty Steiner Tree Problem ⋮ Parameterized analysis of the online priority and node-weighted Steiner tree problems

Cites Work

• Worst-case performance of some heuristics for Steiner's problem in directed graphs
• A dual ascent approach for steiner tree problems on a directed graph
• Steiner problem in networks: A survey
• Dynamic Steiner Tree Problem
• An approximation scheme for some Steiner tree problems in the plane
• Routing to Multiple Destinations in Computer Networks
• The Performance of greedy algorithms for the on-line steiner tree and related problems
• A faster approximation algorithm for the Steiner problem in graphs

This page was built for publication: THE EFFECT OF ASYMMETRY ON THE ON-LINE MULTICAST ROUTING PROBLEM