Article ID: | iaor20022447 |
Country: | United States |
Volume: | 31 |
Issue: | 4 |
Start Page Number: | 283 |
End Page Number: | 292 |
Publication Date: | Jul 1998 |
Journal: | Networks |
Authors: | Ueno Shuichi, Kajitani Yoji, Halldrsson Magns M., Nakao Hiroshi |
Keywords: | Steiner problem |
We analyze the approximation ratio for the average distance heuristic for the Steiner tree problem on graphs and prove nearly tight bounds for the cases of complete graphs with binary weights {1,