Algorithme approximation And NotEdgar A. Ramos
List of bibliographic references
Number of relevant bibliographic references: 8.| Ident. | Authors (with country if any) | Title |
|---|---|---|
| 000102 | Vincent Boudht [France] ; Johanne Cohhn [France] ; Rodolphe Giroudeau [France] ; Jean-Clalide Könic [France] | SCHEDULING IN THE PRESENCE OF PROCESSOR NETWORKS: COMPLEXITY AND APPROXIMATION |
| 000134 | S. Chevillard [France] ; J. Harrison [États-Unis] ; M. Joldes [France] ; Ch. Lauter [France] | Efficient and accurate computation of upper bounds of approximation errors |
| 000229 | A. Bellanger [France] ; A. Oulamara [France] | Scheduling hybrid flowshop with parallel batching machines and compatibilities |
| 000362 | Johanne Cohen [France] ; Fedor Fomin [Norvège] ; Pinar Heggemes [Norvège] ; Dieter Kratsch [France] ; Gregory Kucherov [France] | Optimal linear arrangement of interval graphs |
| 000592 | Johanne Cohen [France] ; Emmanuel Jeannot [France] ; Nicolas Padoy [France] | Messages scheduling for data redistribution between clusters |
| 000735 | N. N. Pisaruk [France] | A fully combinatorial 2-approximation algorithm for precedence-constrained scheduling a single machine to minimize average weighted completion time |
| 000834 | J.-D. Boissonnat [France] ; S. K. Ghosh [Inde] ; T. Kavitha [Inde] ; S. Lazard [France] | An algorithm for computing a convex and simple path of bounded curvature in a simple polygon |
| 000997 | Assefaw Hadish Gebremedhin [Norvège] ; Isabelle Guérin Lassous [France] ; Jens Gustedt [France] ; Jan Arne Telle [Norvège] | Graph coloring on a coarse grained multiprocessor : (Extended abstract) |
| This area was generated with Dilib version V0.6.33. |  |