Sciweavers

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

70

STOC
2003
ACM

80views Algorithms» more STOC 2003»

Polylogarithmic inapproximability

16 years 3 months ago

Polylogarithmic inapproximability

Download www.wisdom.weizmann.ac.il

Eran Halperin, Robert Krauthgamer

Real-time Traffic

Algorithms | Polylogarithmic Inapproximability | STOC 2003 |

claim paper

Related Content

» Approximation of Natural WPComplete Minimisation Problems Is Hard

» On Minimum Power Connectivity Problems

» On the approximability of influence in social networks

» Algorithmic Pricing via Virtual Valuations

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2003
Where	STOC
Authors	Eran Halperin, Robert Krauthgamer

Comments (0)