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

S. Anand et al. (2017)

> Home

Details and statistics

DOI: 10.1007/S00453-015-0082-Y

access: closed

type: Journal Article

metadata version: 2021-10-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/0002B0G017
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/0002B0G017
S. Anand, Karl Bringmann, Tobias Friedrich, Naveen Garg, Amit Kumar:
Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines. Algorithmica 77(2): 515-536 (2017)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.