Construction algorithms and approximation bounds for the streaming cache placement problem in multicast networks
type: Item
instance of: scholarly article
title: Construction algorithms and approximation bounds for the streaming cache placement problem in multicast networks
zbMATH Open document ID: 1102.68733
author: Carlos A. S. Oliveira
author: Panos M. Pardalos
published in: Cybernetics and Systems Analysis
publication date: 2006-11-28T00:00:00Z
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68M12
zbMATH DE Number: 5076486
MaRDI profile type: Publication
full work available at URL: s10559-006-0026-2
OpenAlex ID: W1984192656
cites work: A threshold of ln n for approximating set cover
cites work: Optimization, approximation, and complexity classes
DOI: 10.1007/S10559-006-0026-2
Recommended article: Experimental and Efficient Algorithms
Recommended article: Algorithms and Computation
Recommended article: Approximation algorithms for the k-source multicast tree construction problem
Recommended article: Approximation algorithms for general packing problems and their application to the multicast congestion problem
Recommended article: Q2762511
Recommended article: Q4437506
Recommended article: Fast approximation of minimum multicast congestion – Implementation VERSUS Theory
Recommended article: An O (log k )-Competitive Algorithm for Generalized Caching
Recommended article: Q5743509
description: scientific article; zbMATH DE number 5076486