approximation algorithm / cheapest solution / facility location algorithms / approximate³solution / 3approximation algorithm / local area networks / dynamic programming algorithm / communication protocols / nearest portal / communication network / approximation algorithms / /
Organization
Max-Planck-Institut f¨ur Informatik / /
Person
Stephen Deering / Gianluca Rossi / Yinyu Ye / Massimo Lauria / Joseph S. B. Mitchell / Mohammad Mahdian / Stefan Funke / David Peleg / Ernst Althaus / Samir Khuller / Van Jacobson / David B. Shmoys / Jittat Fakcharoenphol / Martin Skutella / Miriam Di Ianni / George C. Polyzos / Stavros G. Kolliopoulos / Sudipto Guha / Dino Farinacci / Sanjeev Arora / Prabhakar Raghavan / Kunal Talwar / David R. Cheriton / Jochen Ko / Stephen E. Deering / Andrea E. F. Clementi / Karen Aardal / Vachaspathi P. Kompella / Fabian A. Chudak / Deborah Estrin / Jiawei Zhang / Edgar A. Ramos / Satish Rao / Riccardo Silvestri / Angelo Monti / Joseph C. Pasquale / Erez Kantor / /
ProvinceOrState
Ontario / /
PublishedMedium
SIAM Journal on Computing / /
Technology
polynomial time 1.463-approximation algorithm / approximation algorithm / 3approximation algorithm / J. Algorithms / ESA / dynamic programming algorithm / 1.77-approximation algorithm / communication protocols / local area networks / facility location algorithms / Improved approximation algorithms / /
CCCG 2007, Ottawa, Ontario, August 20–22, 2007 Approximating k-hop Minimum Spanning Trees in Euclidean Metrics S¨oren Laue∗ Abstract