Linear-Time Approximation for Maximum Weight Matching

@article{Duan2014LinearTimeAF,
  title={Linear-Time Approximation for Maximum Weight Matching},
  author={Ran Duan and Seth Pettie},
  journal={J. ACM},
  year={2014},
  volume={61},
  pages={1:1-1:23}
}
The <i>maximum cardinality</i> and <i>maximum weight matching</i> problems can be solved in <i>Õ</i>(<i>m</i>√<i>n</i>) time, a bound that has resisted improvement despite decades of research. (Here <i>m</i> and <i>n</i> are the number of edges and vertices.) In this article, we demonstrate that this “<i>m</i>√<i>n</i> barrier” can be bypassed by… CONTINUE READING

5 Figures & Tables

Topics

Statistics

010203020142015201620172018
Citations per Year

94 Citations

Semantic Scholar estimates that this publication has 94 citations based on the available data.

See our FAQ for additional information.