Complexity and Approximation for Precedence Constrained Scheduing Problems with Large Communication Delays - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2005

Complexity and Approximation for Precedence Constrained Scheduing Problems with Large Communication Delays

Dates and versions

lirmm-00402647 , version 1 (07-07-2009)

Identifiers

Cite

Rodolphe Giroudeau, Jean-Claude König, Feryal Windal, Jérôme Palaysi. Complexity and Approximation for Precedence Constrained Scheduing Problems with Large Communication Delays. Euro-Par: European Conference on Parallel Computing, Aug 2005, Lisboa, Portugal. pp.252-261, ⟨10.1007/11549468_30⟩. ⟨lirmm-00402647⟩
69 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More