Video distribution under multiple constraints
From MaRDI portal
Recommendations
- Algorithms for storage allocation based on client preferences
- scientific article; zbMATH DE number 2156296
- Sharing video on demand
- Traffic Estimation and Capacity Assignment in Multimedia Distribution Networks with Guaranteed Quality of Service
- Optimal dynamic video-on-demand using adaptive broadcasting
Cites work
- A note on maximizing a submodular set function subject to a knapsack constraint
- A threshold of ln n for approximating set cover
- Algorithmic construction of sets for k -restrictions
- An analysis of approximations for maximizing submodular set functions—I
- Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- scientific article; zbMATH DE number 3635849 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1969704 (Why is no real title available?)
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Pipage rounding: a new method of constructing algorithms with proven performance guarantee
- The budgeted maximum coverage problem
Cited in
(4)- Efficient stream distribution algorithm for heterogeneous multimedia multicast with link capacity constraint
- Utility maximization for asynchronous streaming of bufferable information flows
- A window-assisted video partitioning strategy for partitioning and caching video streams in distributed multimedia systems
- Algorithms for storage allocation based on client preferences
This page was built for publication: Video distribution under multiple constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q551203)