Approximation and Online Algorithms

DOI10.1007/B106130MaRDI QIDQ5713438zbMATHOpenAlexFDO

Authors Udo Adamy, Thomas Erlebach, D. Mitsche, Ingo Schurr, Bettina Speckmann, Emo Welzl

Publication date 14 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b106130

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Communication networks in operations research (90B18)

Recommendations

• scientific article; zbMATH DE number 1947059
• Admission control in networks with advance reservations
• Admission control with advance reservations in simple networks
• A Novel Approximate Algorithm for Admission Control
• Admission Control to Minimize Rejections

Cited in

(3)

• Admission control with advance reservations in simple networks
• A Novel Approximate Algorithm for Admission Control
• Admission control in networks with advance reservations

This page was built for publication: Approximation and Online Algorithms

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