Login / Signup

Integrality gaps for sparsest cut and minimum linear arrangement problems.

Nikhil R. DevanurSubhash KhotRishi SaketNisheeth K. Vishnoi
Published in: STOC (2006)
Keyphrases
  • linear systems
  • solving problems
  • data sets
  • fractional programming
  • convex quadratic programming
  • real time
  • np complete
  • metaheuristic