1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.DS2007
A Partition-Based Relaxation For Steiner Trees
Jochen Konemann, David Pritchard, Kunlun Tan
The Steiner tree problem is a classical NP-hard optimization problem with a wide range of practical applications. In an instance of this problem, we are given an undirected graph G…
cs.DC2007★ 1 cited
Nearest Neighbor Network Traversal
David Pritchard
A mobile agent in a network wants to visit every node of an n-node network, using a small number of steps. We investigate the performance of the following ``nearest neighbor'' heur…