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

  title={Further Approximations for Demand Matching: Matroid Constraints and Minor-Closed Graphs},
  author={S. Ahmadian and Zachary Friggstad},
  • S. Ahmadian, Zachary Friggstad
  • Published 2017
  • Mathematics, Computer Science
  • ArXiv
  • 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, edge profits, and asymmetric demands on the edges. The goal is to find a maximum-profit subset of edges so the demands of chosen edges do not violate vertex capacities. This problem is APX-hard and constant-factor approximations are known. Our results fall into two categories. First, using iterated relaxation and… CONTINUE READING
    1 Citations
    Scheduling Problems over Network of Machines
    • 1
    • PDF


    The Demand Matching Problem
    • 29
    • Highly Influential
    • PDF
    Iterative Packing for Demand and Hypergraph Matching
    • 22
    • PDF
    A Mazing 2+∊ Approximation for Unsplittable Flow on a Path
    • 39
    • PDF
    Algorithmic graph minor theory: Decomposition, approximation, and coloring
    • 209
    • PDF
    Solving Packing Integer Programs via Randomized Rounding with Alterations
    • 41
    • Highly Influential
    • PDF
    A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
    • 1,071
    • PDF
    Network design with weighted degree constraints
    • 8
    • PDF
    Planar Formulae and Their Uses
    • 739
    Spanning trees with minimum weighted degrees
    • 5
    • PDF
    Linear degree extractors and the inapproximability of max clique and chromatic number
    • 690
    • PDF