Login / Signup

Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut.

Christoph AmbühlMonaldo MastrolilliOla Svensson
Published in: SIAM J. Comput. (2011)
Keyphrases
  • edge information
  • edge detection
  • minimum cost
  • integrality gap
  • linear systems
  • linear constraints
  • data sets
  • neural network
  • weighted graph
  • semidefinite
  • minimum cut
  • square error