Login / Signup

Greedily Approximating the r-independent Set and k-center Problems on Random Instances.

Bernd KreuterTill Nierhoff
Published in: RANDOM (1997)
Keyphrases
  • independent set
  • random instances
  • hard problems
  • phase transition
  • social networks
  • np complete
  • randomly generated