Sciweavers

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

109

Voted

JISE
2006

107views more JISE 2006»

FasterDSP: A Faster Approximation Algorithm for Directed Steiner Tree Problem

15 years 2 months ago

FasterDSP: A Faster Approximation Algorithm for Directed Steiner Tree Problem

Download www.iis.sinica.edu.tw

Ming-I Hsieh, Eric Hsiao-Kuang Wu, Meng-Feng Tsai

Real-time Traffic

JISE 2006 |

claim paper

Related Content

» Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem

» An Improved LPbased Approximation for Steiner Tree

» Integrality ratio for group Steiner trees and directed steiner trees

» The Polymatroid Steiner Problems

» A Steiner Tree approach to efficient object detection

» A faster implementation of the GoemansWilliamson clustering algorithm

» Approximating rooted Steiner networks

» Online Priority Steiner Tree Problems

» Faster approximation algorithms for the minimum latency problem

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2006
Where	JISE
Authors	Ming-I Hsieh, Eric Hsiao-Kuang Wu, Meng-Feng Tsai

Comments (0)