| 2003 |
|---|
| 6 | EE | Christopher S. Helvig,
Gabriel Robins,
Alexander Zelikovsky:
The moving-target traveling salesman problem.
J. Algorithms 49(1): 153-174 (2003) |
| 2001 |
|---|
| 5 | EE | Christopher S. Helvig,
Gabriel Robins,
Alexander Zelikovsky:
An improved approximation scheme for the Group Steiner Problem.
Networks 37(1): 8-20 (2001) |
| 2000 |
|---|
| 4 | EE | Christopher S. Helvig,
Gabriel Robins,
Alexander Zelikovsky:
New approximation algorithms for routing with multiport terminals.
IEEE Trans. on CAD of Integrated Circuits and Systems 19(10): 1118-1128 (2000) |
| 1998 |
|---|
| 3 | EE | Christopher S. Helvig,
Gabriel Robins,
Alexander Zelikovsky:
Improved Approximation Bounds for the Group Steiner Problem.
DATE 1998: 406-413 |
| 2 | EE | Christopher S. Helvig,
Gabriel Robins,
Alexander Zelikovsky:
Moving-Target TSP and Related Problems.
ESA 1998: 453-464 |
| 1997 |
|---|
| 1 | EE | C. Douglass Bateman,
Christopher S. Helvig,
Gabriel Robins,
Alexander Zelikovsky:
Provably good routing tree construction with multi-port terminals.
ISPD 1997: 96-102 |
