BibTeX record journals/talg/DrescherV10

download as .bib file

@article{DBLP:journals/talg/DrescherV10,
  author       = {Matthew Drescher and
                  Adrian Vetta},
  title        = {An approximation algorithm for the maximum leaf spanning arborescence
                  problem},
  journal      = {{ACM} Trans. Algorithms},
  volume       = {6},
  number       = {3},
  pages        = {46:1--46:18},
  year         = {2010},
  url          = {https://doi.org/10.1145/1798596.1798599},
  doi          = {10.1145/1798596.1798599},
  timestamp    = {Wed, 14 Nov 2018 10:21:14 +0100},
  biburl       = {https://dblp.org/rec/journals/talg/DrescherV10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.