| 書目名稱 | WALCOM: Algorithms and Computation |
| 副標(biāo)題 | 5th International Wo |
| 編輯 | Naoki Katoh,Amit Kumar |
| 視頻video | http://file.papertrans.cn/1021/1020030/1020030.mp4 |
| 概述 | fast track conference proceedings |
| 叢書名稱 | Lecture Notes in Computer Science |
| 圖書封面 |  |
| 描述 | This book constitutes the proceedings of the 5th International Workshop on Algorithms and Computation, WALCOM 2011, held in New Delhi, India, in February 2011. The 20 papers presented in this volume were carefully reviewed and selected from 57 submissions.The papers are grouped in topical sections on approximation algorithms, hardness, algorithm engineering, computational geometry, string algorithms, and graph algorithms. |
| 出版日期 | Conference proceedings 2011 |
| 關(guān)鍵詞 | approximation algorithms; biconvex graphs; complexity; computational geometry; data structures; dynamic p |
| 版次 | 1 |
| doi | https://doi.org/10.1007/978-3-642-19094-0 |
| isbn_softcover | 978-3-642-19093-3 |
| isbn_ebook | 978-3-642-19094-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 |
| issn_series | 0302-9743 |
| copyright | Springer Berlin Heidelberg 2011 |
|Archiver|手機(jī)版|小黑屋|
派博傳思國(guó)際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-11 09:20
發(fā)表于 2025-3-21 19:22:56
