"A Simpler Proof of Preemptive Total Flow Time Approximation on Parallel ..."

Stefano Leonardi (2006)

> Home

Details and statistics

DOI: 10.1007/11671541_7

access: closed

type: Part in Book or Collection

metadata version: 2022-12-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - series/lncs/Leonardi06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/series/lncs/Leonardi06
Stefano Leonardi:
A Simpler Proof of Preemptive Total Flow Time Approximation on Parallel Machines. Efficient Approximation and Online Algorithms 2006: 203-212

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.