Login / Signup

Improved Approximation Algorithms for Maximum Graph Partitioning Problems.

Gerold JägerAnand Srivastav
Published in: J. Comb. Optim. (2005)
Keyphrases
  • approximation algorithms
  • graph partitioning
  • vertex cover
  • np hard
  • randomized algorithms
  • special case
  • np complete
  • graph model
  • partitioning algorithm
  • multiscale
  • spectral clustering
  • minimum cost