nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
An approximation algorithm for a bottleneck traveling salesman problem
|
Kao, Ming-Yang |
|
2009 |
7 |
3 |
p. 315-326 12 p. |
artikel |
2 |
Approximate hierarchical facility location and applications to the bounded depth Steiner tree and range assignment problems
|
Kantor, Erez |
|
2009 |
7 |
3 |
p. 341-362 22 p. |
artikel |
3 |
Editorial Board
|
|
|
2009 |
7 |
3 |
p. iii-iv nvt p. |
artikel |
4 |
Fair cost-sharing methods for scheduling jobs on parallel machines
|
Bleischwitz, Yvonne |
|
2009 |
7 |
3 |
p. 280-290 11 p. |
artikel |
5 |
Hardness of approximation for orthogonal rectangle packing and covering problems
|
Chlebík, Miroslav |
|
2009 |
7 |
3 |
p. 291-305 15 p. |
artikel |
6 |
Matching subsequences in trees
|
Bille, Philip |
|
2009 |
7 |
3 |
p. 306-314 9 p. |
artikel |
7 |
Preface
|
Italiano, Giuseppe F. |
|
2009 |
7 |
3 |
p. 279- 1 p. |
artikel |
8 |
Tighter approximation bounds for LPT scheduling in two special cases
|
Kovács, Annamária |
|
2009 |
7 |
3 |
p. 327-340 14 p. |
artikel |