Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines

Anand, S.; Bringmann, Karl; Friedrich, Tobias; Garg, Naveen; Kumar, Amit

doi:10.1007/s00453-015-0082-y

Item

ITEM ACTIONSEXPORT

DownloadE-Mail

Please note that a newer version of this item is available:
https://pure.mpg.de/pubman/item/item_2388277_3

DetailsSummary

Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines

Anand, S., Bringmann, K., Friedrich, T., Garg, N., & Kumar, A. (2017). Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines. Algorithmica, 77(2), 515-536. doi:10.1007/s00453-015-0082-y.

Item is Released

show all hide all

Basic

show hide

Item Permalink: https://hdl.handle.net/11858/00-001M-0000-002C-5527-9 Version Permalink: https://hdl.handle.net/11858/00-001M-0000-002C-5528-7

Genre: Journal Article

Files

show Files

Locators

show

Creators

show

hide

Creators:
Anand, S.^{1, 2}, Author
Bringmann, Karl¹, Author
Friedrich, Tobias¹, Author
Garg, Naveen¹, Author
Kumar, Amit³, Author

Affiliations:
1Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019
2Discrete Optimization, MPI for Informatics, Max Planck Society, ou_1116548
3External Organizations, ou_persistent22

Content

show

Details

show

hide

Language(s): eng - English

Dates: Published Online: 2015Date issued: 2017

Publication Status: Issued

Pages: -

Publishing info: -

Table of Contents: -

Rev. Type: -

Identifiers: DOI: 10.1007/s00453-015-0082-y
BibTex Citekey: DBLP:journals/algorithmica/0002B0G017

Degree: -

Event

show

Legal Case

show

Project information

show

Source 1

show

hide

Title: Algorithmica

Source Genre: Journal

Creator(s):

Affiliations:

Publ. Info: New York, NY : Springer-Verlag

Pages: - Volume / Issue: 77 (2) Sequence Number: - Start / End Page: 515 - 536 Identifier: ISSN: 0178-4617
CoNE: https://pure.mpg.de/cone/journals/resource/954925487793