@InProceedings{ahmadian_et_al:LIPIcs.ICALP.2017.55,
author = {Ahmadian, Sara and Friggstad, Zachary},
title = {{Further Approximations for Demand Matching: Matroid Constraints and Minor-Closed Graphs}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {55:1--55:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Chatzigiannakis, Ioannis and Indyk, Piotr and Kuhn, Fabian and Muscholl, Anca},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICALP.2017.55},
URN = {urn:nbn:de:0030-drops-74600},
doi = {10.4230/LIPIcs.ICALP.2017.55},
annote = {Keywords: Approximation Algorithms, Column-Restricted Packing, Demand Matching, Matroids, Planar Graphs}
}