Efficient Algorithms for Optimal Stream Merging for Media-on-Demand

DOI10.1137/S0097539701389245MaRDI QIDQ4651503zbMATH OpenOpenAlexFDO

Authors Amotz Bar-Noy, Richard E. Ladner

Publication date 21 February 2005

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/s0097539701389245

zbMATH Keywords

dynamic programmingmedia-on-demandmonotonicity propertystream merging

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Analysis of algorithms (68W40)

Recommendations

• Competitive on-line stream merging algorithms for media-on-demand. (Extended abstract)
• Off-line and on-line guaranteed start-up delay for media-on-demand with stream merging
• Competitive on-line stream merging algorithms for media-on-demand
• On-line stream merging in a general setting.
• The Dyadic Stream Merging Algorithm

Cited in

(9)

• On-line stream merging in a general setting.
• Off-line and on-line guaranteed start-up delay for media-on-demand with stream merging
• scientific article; zbMATH DE number 1670647 (Why is no real title available?)
• Competitive on-line stream merging algorithms for media-on-demand. (Extended abstract)
• The Dyadic Stream Merging Algorithm
• Competitive on-line stream merging algorithms for media-on-demand
• scientific article; zbMATH DE number 1798170 (Why is no real title available?)
• On-line stream merging with max span and min coverage
• Algorithms for storage allocation based on client preferences

This page was built for publication: Efficient Algorithms for Optimal Stream Merging for Media-on-Demand

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