A near-linear time ε-approximation algorithm for geometric bipartite matching

R. Sharathkumar, Pankaj K. Agarwal. A near-linear time ε-approximation algorithm for geometric bipartite matching. In Howard J. Karloff, Toniann Pitassi, editors, Proceedings of the 44th Symposium on Theory of Computing Conference, STOC 2012, New York, NY, USA, May 19 - 22, 2012. pages 385-394, ACM, 2012. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.