An online algorithm for the dynamic maximal dense tree problem

DOI10.1007/S00453-001-0086-7MaRDI QIDQ1348951zbMATH OpenOpenAlexFDO

Authors V. Pereyra, Baruch Awerbuch, Tripurari Singh

Publication date 21 May 2002

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00453-001-0086-7

zbMATH Keywords

online capacitated multicast problemonline maximal dense tree

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 1559551
• A Preemptive Algorithm for Maximizing Disjoint Paths on Trees
• An online throughput-competitive algorithm for multicast routing and admission control
• scientific article; zbMATH DE number 1303546
• Online Priority Steiner Tree Problems

Cited in

(3)

• Scheduling multicasts on unit-capacity trees and meshes.
• An Optimal On-Line Algorithm for K Servers on Trees
• scientific article; zbMATH DE number 1559551 (Why is no real title available?)

This page was built for publication: An online algorithm for the dynamic maximal dense tree problem

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