Approximation and Online Algorithms

DOI10.1007/B106130zbMATH Open1124.90301OpenAlexW4299357393MaRDI QIDQ5713438FDOQ5713438

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

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)

Cited In (3)

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

   Recommendations

• Title not available (Why is that?) 👍 👎
• 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 👍 👎

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)