English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  On the value of preemption in scheduling

Bartal, Y., Leonardi, S., Shallom, G., & Sitters, R. (2006). On the value of preemption in scheduling. In 9th Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX (pp. 39-48). Berlin, Germany: Springer.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Bartal, Yair, Author
Leonardi, Stefano1, Author           
Shallom, Gill, Author
Sitters, Rene1, Author           
Diaz, Josep, Editor
Jansen, Klaus1, Editor           
Rolim, José D. P., Editor
Zwick, Uri, Editor
Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 2007-04-272006
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: eDoc: 314523
Other: Local-ID: C1256428004B93B8-DEF063F1B495CAD3C12572A300439759-Sitters2006d
 Degree: -

Event

show
hide
Title: Untitled Event
Place of Event: Barcelona, Spain
Start-/End Date: 2006-08-28

Legal Case

show

Project information

show

Source 1

show
hide
Title: 9th Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: Berlin, Germany : Springer
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 39 - 48 Identifier: -

Source 2

show
hide
Title: Lecture Notes in Computer Science
Source Genre: Series
 Creator(s):
Affiliations:
Publ. Info: -
Pages: - Volume / Issue: 4110 Sequence Number: - Start / End Page: - Identifier: -