Complexity and approximations for multimessage multicasting

DOI10.1006/JPDC.1998.1500zbMath0920.68003OpenAlexW2018028824MaRDI QIDQ1286820

Teofilo F. Gonzalez

Publication date: 13 September 1999

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/059fc395efa8ea16480b47a6c123dfd59c7a7654

zbMATH Keywords

multimessage multicastingscheduling problem

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Mathematical problems of computer architecture (68M07)

Related Items (2)

Complexity of pairwise shortest path routing in the grid ⋮ ON SOLVING MULTIMESSAGE MULTICASTING PROBLEMS

This page was built for publication: Complexity and approximations for multimessage multicasting