Admission control with advance reservations in simple networks
From MaRDI portal
Publication:2466012
DOI10.1016/j.jda.2006.10.008zbMath1149.90027OpenAlexW1980138925MaRDI QIDQ2466012
Publication date: 11 January 2008
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2006.10.008
Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Randomized approximation of bounded multicovering problems
- Using fractional primal-dual to schedule split intervals with demands
- A fast approximation algorithm for the multicovering problem
- Label placement by maximum independent set in rectangles
- An analysis of the greedy algorithm for the submodular set covering problem
- Admission control in networks with advance reservations
- One for the price of two: a unified approach for approximating covering problems
- Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles
- A Greedy Heuristic for the Set-Covering Problem
- A linear-time approximation algorithm for the weighted vertex cover problem
- Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data
- A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
- Algorithm Theory - SWAT 2004
- On the Equivalence between the Primal-Dual Schema and the Local Ratio Technique
- Approximation and Online Algorithms
- A unified approach to approximating resource allocation and scheduling
