Sciweavers

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

15

SODA
1998
ACM

favoriteEmaildiscussreport

89views Algorithms» more SODA 1998»

Approximation Algorithms for Directed Steiner Problems

13 years 6 months ago

Approximation Algorithms for Directed Steiner Problems

Download www.ece.uc.edu

Moses Charikar, Chandra Chekuri, To-Yat Cheung, Zu

Real-time Traffic

Algorithms | SODA 1998 |

claim paper

Related Content

» FasterDSP A Faster Approximation Algorithm for Directed Steiner Tree Problem

» Integrality ratio for group Steiner trees and directed steiner trees

» Approximation algorithms for scheduling problems with a modified total weighted tardiness ...

» An Improved LPbased Approximation for Steiner Tree

» The Polymatroid Steiner Problems

» New primaldual algorithms for Steiner tree problems

» Algorithms for Terminal Steiner Trees

» Improved Approximation Algorithms for the Quality of Service Multicast Tree Problem

» Triangulations Loosing Bundles and Weight

Post Info
More Details (n/a)

Added	01 Nov 2010
Updated	01 Nov 2010
Type	Conference
Year	1998
Where	SODA
Authors	Moses Charikar, Chandra Chekuri, To-Yat Cheung, Zuo Dai, Ashish Goel, Sudipto Guha, Ming Li

Comments (0)