Algorithms - ESA 2003
From MaRDI portal
Publication:5897256
DOI10.1007/b13632zbMath1266.68072OpenAlexW1827234103WikidataQ60299159 ScholiaQ60299159MaRDI QIDQ5897256
Bala Kalyanasundaram, Mahe Velauthapillai
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
Related Items (8)
Scheduling broadcasts with deadlines ⋮ Improved on-line broadcast scheduling with deadlines ⋮ Design and analysis of online batching systems ⋮ Scheduling real-time requests in on-demand data broadcast environments ⋮ Competitive analysis of most-request-first for scheduling broadcasts with start-up delay ⋮ Improved online algorithms for the batch scheduling of equal-length jobs with incompatible families to maximize the weighted number of early jobs ⋮ A near optimal scheduler for on-demand data broadcasts ⋮ A tighter extra-resource analysis of online deadline scheduling
This page was built for publication: Algorithms - ESA 2003