Christopher S. Helvig

According to our database, Christopher S. Helvig authored at least 6 papers between 1997 and 2003.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2003

The moving-target traveling salesman problem.

Christopher S. Helvig, Gabriel Robins, Alexander Zelikovsky

J. Algorithms, 2003

2001

An improved approximation scheme for the Group Steiner Problem.

Christopher S. Helvig, Gabriel Robins, Alexander Zelikovsky

Networks, 2001

2000

New approximation algorithms for routing with multiport terminals.

Christopher S. Helvig, Gabriel Robins, Alexander Zelikovsky

IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 2000

1998

Moving-Target TSP and Related Problems.

Christopher S. Helvig, Gabriel Robins, Alexander Zelikovsky

Proceedings of the Algorithms, 1998

Improved Approximation Bounds for the Group Steiner Problem.

Christopher S. Helvig, Gabriel Robins, Alexander Zelikovsky

Proceedings of the 1998 Design, 1998

1997

Provably good routing tree construction with multi-port terminals.

C. Douglass Bateman, Christopher S. Helvig, Gabriel Robins, Alexander Zelikovsky

Proceedings of the 1997 International Symposium on Physical Design, 1997