Fast divide-and-conquer algorithms for preemptive scheduling problems with controllable processing times – A polymatroid optimization approach

Shakhlevich, N.V., Shioura, A. and Strusevich, V.A. (2008) Fast divide-and-conquer algorithms for preemptive scheduling problems with controllable processing times – A polymatroid optimization approach. In: Algorithms - ESA 2008 : 16th Annual European Symposium, Karlsruhe, Germany, September 15-17, 2008. Proceedings. Lecture Notes in Computer Science (5193). Springer , pp. 756-767. ISBN 1611-3349

Abstract

Metadata

Authors/Creators:
  • Shakhlevich, N.V.
  • Shioura, A.
  • Strusevich, V.A.
Copyright, Publisher and Additional Information: © 2008 Springer. This is an author produced version of a paper published in Lecture Notes in Computer Science. Uploaded in accordance with the publisher's self archiving policy.
Institution: The University of Leeds
Academic Units: The University of Leeds > Faculty of Engineering (Leeds) > School of Computing (Leeds)
Depositing User: Sherpa Assistant
Date Deposited: 22 Jan 2009 12:51
Last Modified: 16 Sep 2016 13:42
Published Version: http://dx.doi.org/10.1007/978-3-540-87744-8_63
Status: Published
Publisher: Springer
Refereed: Yes
Identification Number: https://doi.org/10.1007/978-3-540-87744-8_63

Download

Filename: shakhlevitchn1.pdf

Share / Export

Statistics