登入選單

返回Google圖書搜尋

Online Algorithms for Network Design

Adam Meyerson

出版	School of Computer Science, Carnegie Mellon University, 2003
URL	http://books.google.com.hk/books?id=kkg2HQAACAAJ&hl=&source=gbs_api

註釋

Abstract: "We give the first polylogarithmic-competitive online algorithms for two-metric network design problems. These problems are very general, including as special cases such problems as steiner tree, facility location, and concave-cost single commodity flow."