Go to the corresponding LIPIcs Volume Portal 
Kakimura, Naonori ; Kamiyama, Naoyuki ; Takazawa, Kenjiro
pdfformat: 

@InProceedings{kakimura_et_al:LIPIcs:2018:9594, author = {Naonori Kakimura and Naoyuki Kamiyama and Kenjiro Takazawa}, title = {{The bBranching Problem in Digraphs}}, booktitle = {43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)}, pages = {12:112:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770866}, ISSN = {18688969}, year = {2018}, volume = {117}, editor = {Igor Potapov and Paul Spirakis and James Worrell}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9594}, URN = {urn:nbn:de:0030drops95948}, doi = {10.4230/LIPIcs.MFCS.2018.12}, annote = {Keywords: Greedy Algorithm, Packing, Matroid Intersection, Sparsity Matroid, Arborescence} }
Keywords:  Greedy Algorithm, Packing, Matroid Intersection, Sparsity Matroid, Arborescence  
Seminar:  43rd International Symposium on Mathematical Foundations of Computer Science (MFCS 2018)  
Issue Date:  2018  
Date of publication:  20.08.2018 