Sciweavers

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

8

FOCS
2009
IEEE

favoriteEmaildiscussreport

90views Theoretical Computer Science» more FOCS 2009»

Improved Approximation Algorithms for PRIZE-COLLECTING STEINER TREE and TSP

13 years 11 months ago

Improved Approximation Algorithms for PRIZE-COLLECTING STEINER TREE and TSP

Download www-math.mit.edu

Aaron Archer, MohammadHossein Bateni, Mohammad Tag

Real-time Traffic

FOCS 2009 | Theoretical Computer Science |

claim paper

Related Content

» Improved Approximation Algorithms for the Minimum Latency Problem via PrizeCollecting Stro...

» Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems

» PrizeCollecting Data Fusion for CostPerformance Tradeoff in Distributed Inference

» Approximation Algorithms for Euclidean Group TSP

» A faster implementation of the GoemansWilliamson clustering algorithm

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

» Universal approximations for TSP Steiner tree and set cover

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

» Algorithms for Terminal Steiner Trees

Post Info
More Details (n/a)

Added	20 May 2010
Updated	20 May 2010
Type	Conference
Year	2009
Where	FOCS
Authors	Aaron Archer, MohammadHossein Bateni, Mohammad Taghi Hajiaghayi, Howard J. Karloff

Comments (0)