Ruling Out PTAS for Graph Min-Bisection, Dense k-Subgraph, and Bipartite Clique

Subhash Khot. Ruling Out PTAS for Graph Min-Bisection, Dense k-Subgraph, and Bipartite Clique. SIAM Journal on Computing, 36(4):1025-1071, 2006. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.