Search Sciweavers | Sciweavers

25 search results - page 1 / 5

» Approximating the Weight of Shallow Steiner Trees

click to vote

DAM
1999

169views more DAM 1999»

Approximating the Weight of Shallow Steiner Trees

13 years 4 months ago

Download crab.rutgers.edu

This paper deals with the problem of constructing Steiner trees of minimum weight with diameter bounded by d, spanning a given set of vertices in a graph. Exact solutions or logar...

Guy Kortsarz, David Peleg

claim paper

Read More »

click to vote

COCOA
2009
Springer

149views Discrete Geometry» more COCOA 2009»

A PTAS for Node-Weighted Steiner Tree in Unit Disk Graphs

13 years 11 months ago

Download www.cs.iit.edu

Abstract. The node-weighted Steiner tree problem is a variation of classical Steiner minimum tree problem. Given a graph G = (V, E) with node weight function C : V → R+ and a sub...

Xianyue Li, Xiao-Hua Xu, Feng Zou, Hongwei Du, Pen...

claim paper

Read More »

click to vote

ICALP
2009
Springer

138views Programming Languages» more ICALP 2009»

Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs

14 years 4 months ago

Download www-math.mit.edu

We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...

Erik D. Demaine, MohammadTaghi Hajiaghayi, Philip ...

claim paper

Read More »

click to vote

APPROX
2006
Springer

110views Algorithms» more APPROX 2006»

Approximating Buy-at-Bulk and Shallow-Light k-Steiner Trees

13 years 8 months ago