BibTeX
@inproceedings{DBLP:conf/approx/HarbKM05,
author = {Boulos Harb and
Sampath Kannan and
Andrew McGregor},
title = {Approximating the Best-Fit Tree Under L$_{\mbox{p}}$ Norms},
booktitle = {APPROX-RANDOM},
year = {2005},
pages = {123-133},
ee = {http://dx.doi.org/10.1007/11538462_11},
crossref = {DBLP:conf/approx/2005},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
@proceedings{DBLP:conf/approx/2005,
editor = {Chandra Chekuri and
Klaus Jansen and
Jos{\'e} D. P. Rolim and
Luca Trevisan},
title = {Approximation, Randomization and Combinatorial Optimization,
Algorithms and Techniques, 8th International Workshop on
Approximation Algorithms for Combinatorial Optimization
Problems, APPROX 2005 and 9th InternationalWorkshop on Randomization
and Computation, RANDOM 2005, Berkeley, CA, USA, August
22-24, 2005, Proceedings},
booktitle = {APPROX-RANDOM},
publisher = {Springer},
series = {Lecture Notes in Computer Science},
volume = {3624},
year = {2005},
isbn = {3-540-28239-4},
crossref = {DBLP:conf/approx/2005},
bibsource = {DBLP, http://dblp.uni-trier.de}
}
Copyright © 2005-10-10 by Michael Ley (ley@uni-trier.de)