Inproceedings,
Faster Algorithms for k-Medians in Trees.
R. Benkoczi, B. Bhattacharya, M. Chrobak, L. Larmore, and W. Rytter.MFCS, volume 2747 of Lecture Notes in Computer Science, page 218-227. Springer, (2003)
Meta data
- BibTeX key
- conf/mfcs/BenkocziBCLR03
- entry type
- inproceedings
- booktitle
- MFCS
- year
- 2003
- pages
- 218-227
- publisher
- Springer
- series
- Lecture Notes in Computer Science
- volume
- 2747
- crossref
- conf/mfcs/2003
- ee
- https://doi.org/10.1007/978-3-540-45138-9_16
- isbn
- 3-540-40671-9
- url
- http://dblp.uni-trier.de/db/conf/mfcs/mfcs2003.html#BenkocziBCLR03
Tags
Users
Comments and Reviewsshow / hide
Cite this publication
More citation styles
- please select -%0 Conference Paper
%1 conf/mfcs/BenkocziBCLR03
%A Benkoczi, Robert
%A Bhattacharya, Binay K.
%A Chrobak, Marek
%A Larmore, Lawrence L.
%A Rytter, Wojciech
%B MFCS
%D 2003
%E Rovan, Branislav
%E Vojtás, Peter
%I Springer
%K dblp
%P 218-227
%T Faster Algorithms for k-Medians in Trees.
%U http://dblp.uni-trier.de/db/conf/mfcs/mfcs2003.html#BenkocziBCLR03
%V 2747
%@ 3-540-40671-9
@inproceedings{conf/mfcs/BenkocziBCLR03,
added-at = {2017-05-25T00:00:00.000+0200},
author = {Benkoczi, Robert and Bhattacharya, Binay K. and Chrobak, Marek and Larmore, Lawrence L. and Rytter, Wojciech},
biburl = {https://www.bibsonomy.org/bibtex/22551be1c2a78825e1e19b53a4975296d/dblp},
booktitle = {MFCS},
crossref = {conf/mfcs/2003},
editor = {Rovan, Branislav and Vojtás, Peter},
ee = {https://doi.org/10.1007/978-3-540-45138-9_16},
interhash = {a9a9d93a1caede03c748c6b575bc1e37},
intrahash = {2551be1c2a78825e1e19b53a4975296d},
isbn = {3-540-40671-9},
keywords = {dblp},
pages = {218-227},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
timestamp = {2019-05-15T18:11:07.000+0200},
title = {Faster Algorithms for k-Medians in Trees.},
url = {http://dblp.uni-trier.de/db/conf/mfcs/mfcs2003.html#BenkocziBCLR03},
volume = 2747,
year = 2003
}