Moving-Target TSP and Related Problems \Lambda (2008)
C. S. Helvig, Gabriel Robins, Alex Zelikovsky
Abstract Previous literature on the Traveling Salesman Problem (TSP) assumed that the sites to be visited are stationary. Motivated by practical applications, we introduce a time-dependent...
The Moving-Target Traveling Salesman Problem (2008)
C. S. Helvig, Gabriel Robins, Alex Zelikovsky
Previous literature on the Traveling Salesman Problem (TSP) assumed that the sites to be visited are stationary. Motivated by practical applications, we introduce a time-dependent generalization of...
New Approximation Algorithms for Routing with Multi-Port Terminals (2007)
C. S. Helvig, Gabriel Robins, Alexander Zelikovsky, Er Zelikovsky
Previous literature on VLSI routing and wiring estimation typically assumes a one-to-one correspondence between terminals and ports. In practice, however, each "terminal" consists of a...
Improved Approximation Bounds for the Group Steiner Problem (1998)
C. S. Helvig, Gabriel Robins, Alexander Zelikovsky
Given a weighted graph and a family of k disjoint groups of nodes, the Group Steiner Problem asks for a minimum-cost routing tree that contains at least one node from each group. We give...
Improved Approximation Bounds for the Group Steiner Problem (1998)
Helvig Gabriel Robins, C. S. Helvig, Gabriel Robins, Alexander Zelikovsky
Given a weightedgraph and a family of k disjoint groups of nodes, the Group Steiner Problem asks for a minimum-cost routing tree that contains at least one node from each group. We give...
www.elsevier.com/locate/jalgor The moving-target traveling salesman problem ✩ (1998)
C. S. Helvig, A Gabriel Robins, Alex Zelikovsky C
Previous literature on the Traveling Salesman Problem (TSP) assumed that the sites to be visited are stationary. Motivated by practical applications, we introduce a time-dependent generalization of...
Moving-target TSP and related problems (1998)
C. S. Helvig, Gabriel Robins, Alex Zelikovsky
Abstract. Previous literature on the Traveling Salesman Problem (TSP) assumed that the sites to be visited are stationary. Motivated by practical applications, we introduce a time-dependent...
Moving-Target TSP and Related Problems (1997)
C. S. Helvig, Gabriel Robins, Alex Zelikovsky
. Previous literature on the Traveling Salesman Problem (TSP) implicitly assumed that the sites to be visited are stationary. Motivated by practical applications, we introduce a time-dependent...
Moving-Target TSP and Related Problems (1997)
C. S. Helvig, Gabriel Robins, Alex Zelikovsky
. Previous literature on the Traveling Salesman Problem (TSP) assumed that the sites to be visited are stationary. Motivated by practical applications, we introduce a time-dependent generalization of...
Provably Good Routing Tree Construction with Multi-Port Terminals (1997)
C. Douglass Bateman, C. S. Helvig, Gabriel Robins, Alexander Zelikovsky, Er Zelikovsky
Previous literature on VLSI routing and wiring estimation typically assumes a one-to-one correspondence between terminals and ports. In practice, however (say, in a gridded routing regime), each...