@InProceedings{babenko_et_al:LIPIcs.STACS.2011.519,
author = {Babenko, Maxim and Gusakov, Alexey},
title = {{New Exact and Approximation Algorithms for the Star Packing Problem in Undirected Graphs}},
booktitle = {28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)},
pages = {519--530},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-25-5},
ISSN = {1868-8969},
year = {2011},
volume = {9},
editor = {Schwentick, Thomas and D\"{u}rr, Christoph},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2011.519},
URN = {urn:nbn:de:0030-drops-30402},
doi = {10.4230/LIPIcs.STACS.2011.519},
annote = {Keywords: graph algorithms, approximation algorithms, generalized matchings, flows, weighted packings}
}