BibTeX record conf/approx/ChanXKR06

• > Home > conf/approx/ChanXKR06

@inproceedings{DBLP:conf/approx/ChanXKR06,
  author       = {T.{-}H. Hubert Chan and
                  Donglin Xia and
                  Goran Konjevod and
                  Andr{\'{e}}a W. Richa},
  editor       = {Josep D{\'{\i}}az and
                  Klaus Jansen and
                  Jos{\'{e}} D. P. Rolim and
                  Uri Zwick},
  title        = {A Tight Lower Bound for the Steiner Point Removal Problem on Trees},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, 9th International Workshop on Approximation Algorithms
                  for Combinatorial Optimization Problems, {APPROX} 2006 and 10th International
                  Workshop on Randomization and Computation, {RANDOM} 2006, Barcelona,
                  Spain, August 28-30 2006, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {4110},
  pages        = {70--81},
  publisher    = {Springer},
  year         = {2006},
  url          = {https://doi.org/10.1007/11830924\_9},
  doi          = {10.1007/11830924\_9},
  timestamp    = {Sun, 02 Oct 2022 15:54:48 +0200},
  biburl       = {https://dblp.org/rec/conf/approx/ChanXKR06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}