Sciweavers

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

14

STOC
2004
ACM

favoriteEmaildiscussreport

88views Algorithms» more STOC 2004»

Asymmetric k-center is log* n-hard to approximate

14 years 11 months ago

Asymmetric k-center is log* n-hard to approximate

Download www.wisdom.weizmann.ac.il

Julia Chuzhoy, Sudipto Guha, Eran Halperin, Sanjee

Real-time Traffic

Algorithms | Asymmetric K-center | STOC 2004 |

claim paper

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2004
Where	STOC
Authors	Julia Chuzhoy, Sudipto Guha, Eran Halperin, Sanjeev Khanna, Guy Kortsarz, Joseph Naor

Comments (0)