Approximating shallow-light trees

Guy Kortsarz, David Peleg

Research output: Contribution to conferencePaperpeer-review

36 Scopus citations

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 languageEnglish
Pages103-110
Number of pages8
StatePublished - 1997
Externally publishedYes
EventProceedings of the 1996 8th Annual ACM-SIAM Symposium on Discrete Algorithms - New Orleans, LA, USA
Duration: 5 Jan 19977 Jan 1997

Conference

ConferenceProceedings of the 1996 8th Annual ACM-SIAM Symposium on Discrete Algorithms
CityNew Orleans, LA, USA
Period5/01/977/01/97

Fingerprint

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

Cite this