Back to Results
First PageMeta Content
Microsoft Gadgets / Computing / Computational complexity theory / Gadget / Struct


Discrete Comput Geom: 701–722 DOIs00454z Minimum Manhattan Network is NP-Complete Francis Y.L. Chin · Zeyu Guo · He Sun
Add to Reading List

Document Date: 2011-05-04 06:25:07


Open Document

File Size: 854,50 KB

Share Result on Facebook

Company

CNF / /

Country

China / /

/

Facility

Fudan University / The University of Hong Kong / /

IndustryTerm

given network / polynomial-time approximation algorithm / resultant network / primal-dual based algorithm / approximation algorithms / /

Organization

School of Computer Science / University of Hong Kong / F.Y.L. Chin Department of Computer Science / Fudan University / Shanghai / /

Position

Author / /

Technology

polynomial-time approximation algorithm / 1.5-approximation algorithm / 8-approximation algorithm / 3-approximation algorithm / 2-approximation rounding algorithm / finding approximation algorithms / 4-approximation algorithm / 2-approximation algorithm / primal-dual based algorithm / /

SocialTag