Abstract
This Special Issue contains a selection of expanded, peer-reviewed papers originally presented at the 20th Annual European Symposium on Algorithms (ESA 2012) held in Ljubljana, Slovenia, on September 10–12, 2012. The ESA symposia are devoted to fostering and disseminating the results of high quality research on the design and evaluation of algorithms and data structures. The forum seeks original algorithmic contributions for problems with relevant theoretical and/or practical applications and aims at bringing together researchers in the computer science and operations research communities. The conference received 285 submissions from 40 countries and the PC selected 69 papers among which we decided to pick seven excellent papers composing this Special Issue. These journal papers, which have been rigorously reviewed according to the journal standards, cover a wide range of algorithmic topics, thereby appealing to both the experts in the field as well as to those who wish a snapshot of the current breadth of research in this area. The paper on “A Model for Minimizing Active Processor Time” considers an elementary scheduling problem over a collection of n jobs, each having an integer length and a set of time intervals in which it can be feasibly scheduled. Given a parameter B, the processor can schedule up to B jobs at a timeslot t so long as it is “active” at t . The goal is to schedule all the jobs in the fewest number of active timeslots. The machine consumes a fixed amount of energy per active timeslot, regardless of the number of jobs scheduled in that slot (as long as the number of jobs is non-zero). The authors present a linear-time algorithm for the case where jobs are unit length and have a
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call