Login / Signup

A General Class of Heuristics for Minimum Weight Perfect Matching and Fast Special Cases with Doubly and Triply Logarithmic Errors.

Celina ImielinskaBahman Kalantari
Published in: Algorithmica (1997)
Keyphrases
  • special case
  • minimum weight
  • greedy heuristic
  • np hard
  • maximum cardinality
  • approximation algorithms
  • computational complexity
  • bipartite graph
  • maximum weight
  • spanning tree