BibTeX record conf/faw/LiaoZ09

download as .bib file

@inproceedings{DBLP:conf/faw/LiaoZ09,
  author       = {Chung{-}Shou Liao and
                  Louxin Zhang},
  editor       = {Xiaotie Deng and
                  John E. Hopcroft and
                  Jinyun Xue},
  title        = {Approximating the Spanning k-Tree Forest Problem},
  booktitle    = {Frontiers in Algorithmics, Third International Workshop, {FAW} 2009,
                  Hefei, China, June 20-23, 2009. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5598},
  pages        = {293--301},
  publisher    = {Springer},
  year         = {2009},
  url          = {https://doi.org/10.1007/978-3-642-02270-8\_30},
  doi          = {10.1007/978-3-642-02270-8\_30},
  timestamp    = {Tue, 14 May 2019 10:00:38 +0200},
  biburl       = {https://dblp.org/rec/conf/faw/LiaoZ09.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.