Further approximations for demand matching: matroid constraints and minor-closed graphs

DOI10.4230/LIPICS.ICALP.2017.55MaRDI QIDQ5111386zbMATH OpenFDO

Authors Sara Ahmadian, Zachary Friggstad

Publication date 27 May 2020

Full work available at URL https://arxiv.org/abs/1705.10396

zbMATH Keywords

approximation algorithmsplanar graphsmatroidscolumn-restricted packingdemand matching

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25) Signed and weighted graphs (05C22)

Recommendations

• The Demand-Matching Problem
• scientific article; zbMATH DE number 2086940
• Iterative packing for demand and hypergraph matching
• Matroid matching: the power of local search
• Matroid matching: the power of local search

Cited in

(3)

• scientific article; zbMATH DE number 2086940 (Why is no real title available?)
• Iterative packing for demand and hypergraph matching
• The Demand-Matching Problem

This page was built for publication: Further approximations for demand matching: matroid constraints and minor-closed graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111386)