Algorithm Design Complexity

Research Frontiers in Approximation Algorithms for Bipartite Matching

Study of algorithms for computing maximum matchings, weighted matchings, and b-matchings in bipartite and general graphs.

All Algorithm Design & Complexity PhD categories