Construction algorithms and approximation bounds for the streaming cache placement problem in multicast networks

DOI10.1007/S10559-006-0026-2MaRDI QIDQ852254zbMATH OpenOpenAlexFDO

Authors Carlos A. S. Oliveira, Panos M. Pardalos

Publication date 28 November 2006

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10559-006-0026-2

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Network protocols (68M12) Approximation algorithms (68W25)

Recommendations

• Experimental and Efficient Algorithms
• Algorithms and Computation
• Approximation algorithms for the k-source multicast tree construction problem
• Approximation algorithms for general packing problems and their application to the multicast congestion problem
• scientific article; zbMATH DE number 1688370
• scientific article; zbMATH DE number 2011854
• Fast approximation of minimum multicast congestion – Implementation VERSUS Theory
• An \(O(\log k)\)-competitive algorithm for generalized caching
• An \(O(\log k)\)-competitive algorithm for generalized caching

Cites work

• A threshold of ln n for approximating set cover
• Optimization, approximation, and complexity classes

Cited in

(3)

• A branch-and-cut algorithm for the Steiner tree problem with delays
• Mathematical programming approaches for dual multicast routing problem with multilayer risk cost
• Redundant multicast routing in multilayer networks with shared risk resource groups: complexity, models and algorithms

This page was built for publication: Construction algorithms and approximation bounds for the streaming cache placement problem in multicast networks

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