Go to the corresponding Portal 
Babenko, Maxim ; Gusakov, Alexey
pdfformat: 

@InProceedings{babenko_et_al:LIPIcs:2011:3040, author = {Maxim Babenko and Alexey Gusakov}, 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 = {519530}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783939897255}, ISSN = {18688969}, year = {2011}, volume = {9}, editor = {Thomas Schwentick and Christoph D{\"u}rr}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2011/3040}, URN = {urn:nbn:de:0030drops30402}, doi = {http://dx.doi.org/10.4230/LIPIcs.STACS.2011.519}, annote = {Keywords: graph algorithms, approximation algorithms, generalized matchings, flows, weighted packings} }
Keywords:  graph algorithms, approximation algorithms, generalized matchings, flows, weighted packings  
Seminar:  28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011)  
Issue Date:  2011  
Date of publication:  11.03.2011 