Further Approximations for Demand Matching: Matroid Constraints and Minor-Closed Graphs

Sara Ahmadian, Zachary Friggstad

We pursue a study of the Generalized Demand Matching problem, a common generalization of the $b$-Matching and Knapsack problems. Here, we are given a graph with vertex capacities,…