Login / Signup

Approximability of the minimum-weight k-size cycle cover problem.

Michael Yu. KhachayKatherine Neznakhina
Published in: J. Glob. Optim. (2016)
Keyphrases
  • minimum weight
  • spanning tree
  • bipartite graph
  • weighted graph
  • greedy heuristic
  • upper bound
  • random walk
  • greedy algorithm