Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Conferences, Workshops, Symposiums, and Seminars
  4. Towards Tight Lower Bounds for Scheduling Problems
 
conference paper

Towards Tight Lower Bounds for Scheduling Problems

Bazzi, Abbas  
•
Norouzi-Fard, Ashkan
2015
23rd Annual European Symposium on Algorithms (ESA)
  • Details
  • Metrics
Type
conference paper
Author(s)
Bazzi, Abbas  
Norouzi-Fard, Ashkan
Date Issued

2015

Published in
23rd Annual European Symposium on Algorithms (ESA)
Start page

118

End page

129

Editorial or Peer reviewed

REVIEWED

Written at

OTHER

EPFL units
THL2  
Available on Infoscience
May 22, 2017
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/137474
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés