The k-Constrained Bipartite Matching Problem: Approximation Algorithms and Applications to Wireless Networks - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Andre Berger, James Gross, Tobias Harks. The k-Constrained Bipartite Matching Problem: Approximation Algorithms and Applications to Wireless Networks. In INFOCOM 2010. 29th IEEE International Conference on Computer Communications, Joint Conference of the IEEE Computer and Communications Societies, 15-19 March 2010, San Diego, CA, USA. pages 2043-2051, IEEE, 2010. [doi]

This author has not been identified. Look up 'Andre Berger' in GoogleThis author has not been identified. Look up 'James Gross' in GoogleThis author has not been identified. Look up 'Tobias Harks' in Google

runs on WebDSL