Abstract
This paper deals with the problem of constructing Steiner trees of minimum weight with diameter bounded by d, spanning a given set, V of ν vertices in a graph. Exact solutions or logarithmic ratio approximation algorithms were known before for the cases of d≤5. Here we give a polynomial time approximation algorithm of ratio d log ν for constant d, and an algorithm of ratio νε, for any fixed 0<ε<1, for general d.
| Original language | English |
|---|---|
| Pages | 103-110 |
| Number of pages | 8 |
| State | Published - 1997 |
| Event | Proceedings of the 1996 8th Annual ACM-SIAM Symposium on Discrete Algorithms - New Orleans, LA, USA Duration: 5 Jan 1997 → 7 Jan 1997 |
Conference
| Conference | Proceedings of the 1996 8th Annual ACM-SIAM Symposium on Discrete Algorithms |
|---|---|
| City | New Orleans, LA, USA |
| Period | 5/01/97 → 7/01/97 |