Near Approximation of Maximum Weight Matching through Efficient Weight Reduction


Let G be an edge-weighted hypergraph on n vertices, m edges of size O(1), where the edges have real weights in an interval [1, W ]. We show that if we can approximate a maximum weight matching in G within factor α in time T (n,m,W ) then we can find a matching of weight at least (α − ǫ) times the maximum weight of a matching in G in time (ǫ) max 1≤q≤O(ǫ log… (More)
DOI: 10.1007/978-3-642-20877-5_6


3 Figures and Tables