Sciweavers

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

99

Voted

SODA
2010
ACM

favoriteEmaildiscussreport

185views Algorithms» more SODA 2010»

Paired Approximation Problems and Incompatible Inapproximabilities

15 years 10 months ago

Paired Approximation Problems and Incompatible Inapproximabilities

Download www.ics.uci.edu

David Eppstein

Real-time Traffic

Approximation Problems | Discrete Algorithms | SODA 2010 |

claim paper

Related Content

» Inapproximability Results for the Lateral Gene Transfer Problem

» Inapproximability of edgedisjoint paths and low congestion routing on undirected graphs

» Vertex Cover in Graphs with Locally Few Colors

Post Info
More Details (n/a)

Added	01 Mar 2010
Updated	02 Mar 2010
Type	Conference
Year	2010
Where	SODA
Authors	David Eppstein

Comments (0)