Combining online algorithms for acceptance and rejection

DOI10.4086/TOC.2005.V001A006MaRDI QIDQ3002759zbMATH OpenOpenAlexFDO

Authors David P. Bunde, Yishay Mansour, Yossi Azar, Avrim Blum

Publication date 24 May 2011

Published in Theory of Computing (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NoDerivs 4.0 International

Full work available at URL https://doi.org/10.4086/toc.2005.v001a006

zbMATH Keywords

admission controlcommunication networkscompetitive analysisonline algorithmsquality of serviceresource allocation

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Online algorithms; streaming algorithms (68W27)

Recommendations

• Admission Control to Minimize Rejections
• scientific article; zbMATH DE number 1830730
• An online throughput-competitive algorithm for multicast routing and admission control
• Admission control to minimize rejections and online set cover with repetitions
• A Novel Approximate Algorithm for Admission Control

Cited in

(4)

• Approximation algorithms for the ring loading problem with penalty cost
• Buyback problem -- approximate matroid intersection with cancellation costs
• scientific article; zbMATH DE number 5957338 (Why is no real title available?)
• On-line selection of an acceptable pair

This page was built for publication: Combining online algorithms for acceptance and rejection

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