Video distribution under multiple constraints

DOI10.1016/J.TCS.2011.03.031zbMath1228.90038OpenAlexW1999794340MaRDI QIDQ551203

Boaz Patt-Shamir, Dror Rawitz

Publication date: 14 July 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.03.031

zbMATH Keywords

schedulingresource allocationapproximation algorithmsbudgeted set covervideo distribution

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on maximizing a submodular set function subject to a knapsack constraint
• The budgeted maximum coverage problem
• Pipage rounding: a new method of constructing algorithms with proven performance guarantee
• Algorithmic construction of sets for k -restrictions
• A threshold of ln n for approximating set cover
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• An analysis of approximations for maximizing submodular set functions—I
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

This page was built for publication: Video distribution under multiple constraints