On-line resource management with applications to routing and scheduling

DOI10.1007/3-540-60084-1_83zbMath1412.68301OpenAlexW1598141101MaRDI QIDQ4645187

Stefano Leonardi, Alberto Marchetti-Spaccamela

Publication date: 10 January 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60084-1_83

zbMATH Keywords

competitive ratioknapsack problemcompetitive algorithminteger variableglobal cost

Mathematics Subject Classification ID

Linear programming (90C05) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Online algorithms; streaming algorithms (68W27)

Cites Work

• Probabilistic construction of deterministic algorithms: approximating packing integer programs
• Approximating maximum independent sets by excluding subgraphs
• Efficient On-Line Call Control Algorithms
• On-line load balancing with applications to machine scheduling and virtual circuit routing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On-line resource management with applications to routing and scheduling