Admission control in networks with advance reservations

DOI10.1007/s00453-004-1114-1zbMath1082.68004OpenAlexW2075883130MaRDI QIDQ1884772

Ariel Orda, Joseph (Seffi) Naor, Liane Lewin-Eytan

Publication date: 5 November 2004

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-004-1114-1

zbMATH Keywords

Approximation algorithmsIndependent setLocal ratioLine networkAdvance reservationsAxis parallel rectangles

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Approximation algorithms (68W25)

Related Items (5)

Using fractional primal-dual to schedule split intervals with demands ⋮ Admission control with advance reservations in simple networks ⋮ Matching colored points with rectangles ⋮ Minimum vertex cover in rectangle graphs ⋮ Resource allocation in bounded degree trees

This page was built for publication: Admission control in networks with advance reservations