1 paper
Yuchong Pan, Michel X. Goemans
The demand matching problem generalizes both the knapsack problem and the b-matching problem. In this problem, each edge of a graph has a demand and a weight, each vertex has a c…