|Nice Answer||Answer score of 10 or more. This badge can be awarded multiple times.|
Chandra Chekuri earned this badge 8 times
dec 4 at 4:29Hardness of approximation without the PCP theorem
apr 30 '12 at 10:59Problems that are hard w.r.t UGC-hardness of VERTEX COVER
mar 29 '12 at 16:26“Directed” problems that are easier than their “undirected” variant.
dec 11 '11 at 16:50Theoretical Applications for Approximation Algorithms
sep 7 '11 at 19:22Dynamic programming and shortest path problem
feb 6 '11 at 13:13NP-hard problems on trees
dec 10 '10 at 17:20What are the recent TCS books whose drafts are available online?