Real time scheduling with a budget: parametric-search is better than binary search

DOI10.1016/J.IPL.2006.04.011zbMath1185.68116OpenAlexW1999098332MaRDI QIDQ845717

Asaf Levin

Publication date: 29 January 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2006.04.011

zbMATH Keywords

approximation algorithmsparametric-search method

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Strongly polynomial-time approximation for a class of bicriteria problems.
• Approximation algorithms for metric facility location and k -Median problems using the primal-dual schema and Lagrangian relaxation
• Combinatorial Optimization with Rational Objective Functions
• Bicriteria Network Design Problems
• A unified approach to approximating resource allocation and scheduling

This page was built for publication: Real time scheduling with a budget: parametric-search is better than binary search