Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

NETWORKS
1998

favoriteEmaildiscussreport

113views Computer Networks» more NETWORKS 1998»

Approximating Steiner trees in graphs with restricted weights

13 years 4 months ago

Approximating Steiner trees in graphs with restricted weights

Download www.lab.ss.titech.ac.jp

Magnús M. Halldórsson, Shuichi Ueno,

Real-time Traffic

Computer Networks | NETWORKS 1998 |

claim paper

Related Content

» A PTAS for NodeWeighted Steiner Tree in Unit Disk Graphs

» An Improved LPbased Approximation for Steiner Tree

» NodeWeighted Steiner Tree and Group Steiner Tree in Planar Graphs

» Approximating the Weight of Shallow Steiner Trees

» Improved Steiner tree approximation in graphs

» Steiner points in tree metrics dont really help

» Algorithms for Terminal Steiner Trees

» STAR SteinerTree Approximation in Relationship Graphs

» The Polymatroid Steiner Problems

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	1998
Where	NETWORKS
Authors	Magnús M. Halldórsson, Shuichi Ueno, Hiroshi Nakao, Yoji Kajitani

Comments (0)