Algorithms - ESA 2003

DOI10.1007/b13632zbMath1266.68067OpenAlexW1827234103WikidataQ60299159 ScholiaQ60299159MaRDI QIDQ5897233

Nikhil Bansal, Kedar Dhamdhere, Shuchi Chawla, Avrim L. Blum

Publication date: 3 March 2010

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b13632

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (4)

Bin packing with rejection revisited ⋮ Rejecting jobs to minimize load and maximum flow-time ⋮ Minimizing average flow-time under knapsack constraint ⋮ Non-Preemptive Flow-Time Minimization via Rejections

This page was built for publication: Algorithms - ESA 2003