ACM Symposium on Discrete Algorithms, SODA 2014


Article Details
Title: Near Linear Time Approximation Schemes for Uncapacitated and Capacitated b-Matching Problems in Nonbipartite Graphs
Article URLs:
Alternative Article URLs:
Authors: Kook Jin Ahn
  • Google, 1600 Amphitheatre Parkway Mountain View, CA 94043
Sudipto Guha
  • University of Pennsylvania, Department of Computer and Information Sciences
Sharing: Unknown
Verification: Authors have not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers: 1117216
DBLP Key: conf/soda/AhnG14
Author Comments:

Discuss this paper and its artifacts below