English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
 
 
DownloadE-Mail
  Competitive Algorithms for Due Date Schedulin

Bansal, N., Chan, H.-L., & Pruhs, K. (2011). Competitive Algorithms for Due Date Schedulin. Algorithmica, 59(4), 569-582. doi:10.1007/s00453-009-9321-4.

Item is

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Bansal, Nikhil1, Author
Chan, Ho-Leung2, Author           
Pruhs, KIrk1, Author
Affiliations:
1External Organizations, ou_persistent22              
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 20112011
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: Peer
 Identifiers: eDoc: 618743
DOI: 10.1007/s00453-009-9321-4
URI: http://dx.doi.org/10.1007/s00453-009-9321-4
Other: Local-ID: C1256428004B93B8-4D7F8CC751349A60C12579C90051877A-Chan2011
 Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show
hide
Title: Algorithmica
Source Genre: Journal
 Creator(s):
Affiliations:
Publ. Info: Berlin : Springer
Pages: - Volume / Issue: 59 (4) Sequence Number: - Start / End Page: 569 - 582 Identifier: ISSN: 0178-4617