Sciweavers

ESA
1999
Springer
148views Algorithms» more  ESA 1999»
14 years 3 months ago
Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines
We give a polynomial approximation scheme for the problem of scheduling on uniformly related parallel machines for a large class of objective functions that depend only on the mac...
Leah Epstein, Jiri Sgall
ICCAD
2006
IEEE
126views Hardware» more  ICCAD 2006»
14 years 8 months ago
Optimizing yield in global routing
We present the first efficient approach to global routing that takes spacing-dependent costs into account and provably finds a near-optimum solution including these costs. We sh...
Dirk Müller