Sciweavers

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

97

Voted

STOC
2005
ACM

89views Algorithms» more STOC 2005»

Universal approximations for TSP, Steiner tree, and set cover

16 years 2 months ago

Universal approximations for TSP, Steiner tree, and set cover

Download www.ccs.neu.edu

Lujun Jia, Guolong Lin, Guevara Noubir, Rajmohan R

Real-time Traffic

Algorithms | STOC 2005 | Universal Approximations |

claim paper

Related Content

» On the Complexity of Approximating TSP with Neighborhoods and Related Problems

» Approximation Algorithms for Euclidean Group TSP

» On the Covering Steiner Problem

» Thresholded Covering Algorithms for Robust and Maxmin Optimization

» How to Pay Come What May Approximation Algorithms for DemandRobust Covering Problems

» The Polymatroid Steiner Problems

» Algorithms and stability analysis for content distribution over multiple multicast trees

» New approaches to covering and packing problems

» New primaldual algorithms for Steiner tree problems

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2005
Where	STOC
Authors	Lujun Jia, Guolong Lin, Guevara Noubir, Rajmohan Rajaraman, Ravi Sundaram

Comments (0)