An online algorithm for the dynamic maximal dense tree problem

DOI10.1007/S00453-001-0086-7zbMATH Open1004.68207OpenAlexW2058109282MaRDI QIDQ1348951

V. Pereyra

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

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

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)