Fast approximation of minimum multicast congestion -- implementation versus theory

DOI10.1007/3-540-44849-7_22MaRDI QIDQ4437506zbMATH OpenFDO

Authors Andreas Baltz, Anand Srivastav

Publication date 2 December 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2653/26530165.htm

zbMATH Keywords

Approximation algorithmsInteger programmingMulticast routing

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Integer programming (90C10)

Recommendations

• Fast approximation of minimum multicast congestion – Implementation VERSUS Theory
• Implementation of approximation algorithms for the multicast congestion problem
• Approximating multicast congestion
• Approximation algorithms for general packing problems and their application to the multicast congestion problem
• Computing and Combinatorics

Cited in

(9)

• scientific article; zbMATH DE number 5454665 (Why is no real title available?)
• Multicast Routing and Design of Sparse Connectors
• Approximating multicast congestion
• scientific article; zbMATH DE number 1532270 (Why is no real title available?)
• Fast approximation of minimum multicast congestion – Implementation VERSUS Theory
• Implementation of approximation algorithms for the multicast congestion problem
• Concurrent multicast in weighted networks
• Construction algorithms and approximation bounds for the streaming cache placement problem in multicast networks
• Approximation algorithms for general packing problems and their application to the multicast congestion problem

This page was built for publication: Fast approximation of minimum multicast congestion -- implementation versus theory

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