Approximating the weight of shallow steiner trees

Guy Kortsarz, David Peleg

Research output: Contribution to journalArticlepeer-review


This paper deals with the problem of constructing Steiner trees of minimum weight with diameter bounded by d, spanning a given set of v 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 O(log v) for constant d, which is asymptotically optimal unless P = NP, and an algorithm of ratio O(vε), for any fixed 0 < ε < 1, for general d.

Original languageEnglish
Pages (from-to)265-285
Number of pages21
JournalDiscrete Applied Mathematics
Issue number2-3
StatePublished - 20 Jul 1999


Dive into the research topics of 'Approximating the weight of shallow steiner trees'. Together they form a unique fingerprint.

Cite this