Search the dblp DataBase
Christopher S. Helvig: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]
Publications of Author
- Christopher S. Helvig, Gabriel Robins, Alexander Zelikovsky
Improved Approximation Bounds for the Group Steiner Problem. [Citation Graph (0, 0)][DBLP]
DATE, 1998, pp:406-413 [Conf] - Christopher S. Helvig, Gabriel Robins, Alexander Zelikovsky
Moving-Target TSP and Related Problems. [Citation Graph (0, 0)][DBLP]
ESA, 1998, pp:453-464 [Conf] - C. Douglass Bateman, Christopher S. Helvig, Gabriel Robins, Alexander Zelikovsky
Provably good routing tree construction with multi-port terminals. [Citation Graph (0, 0)][DBLP]
ISPD, 1997, pp:96-102 [Conf] - Christopher S. Helvig, Gabriel Robins, Alexander Zelikovsky
The moving-target traveling salesman problem. [Citation Graph (0, 0)][DBLP]
J. Algorithms, 2003, v:49, n:1, pp:153-174 [Journal] - Christopher S. Helvig, Gabriel Robins, Alexander Zelikovsky
An improved approximation scheme for the Group Steiner Problem. [Citation Graph (0, 0)][DBLP]
Networks, 2001, v:37, n:1, pp:8-20 [Journal] - Christopher S. Helvig, Gabriel Robins, Alexander Zelikovsky
New approximation algorithms for routing with multiport terminals. [Citation Graph (0, 0)][DBLP]
IEEE Trans. on CAD of Integrated Circuits and Systems, 2000, v:19, n:10, pp:1118-1128 [Journal]
Search in 0.001secs, Finished in 0.002secs
| NOTICE1 |
|---|
| System may not be available sometimes or not working properly, since it is still in development with continuous upgrades |
| NOTICE2 |
|---|
| The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP |
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002