注冊 | 登錄讀書好,好讀書,讀好書!
讀書網(wǎng)-DuShu.com
當(dāng)前位置: 首頁出版圖書科學(xué)技術(shù)計算機/網(wǎng)絡(luò)計算機科學(xué)理論與基礎(chǔ)知識算法與計算:會議錄LNCS-4288 Algorithms and computation

算法與計算:會議錄LNCS-4288 Algorithms and computation

算法與計算:會議錄LNCS-4288 Algorithms and computation

定 價:¥949.20

作 者: Tetsuo Asano 著
出版社: 湖南文藝出版社
叢編項:
標(biāo) 簽: 暫缺

ISBN: 9783540496946 出版時間: 2006-12-01 包裝: 平裝
開本: 頁數(shù): 字?jǐn)?shù):  

內(nèi)容簡介

  This book constitutes the refereed proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC 2006, held in Kolkata, India in December 2006.The 73 revised full papers presented were carefully reviewed and selected from 255 submissions. The papers are organized in topical sections on algorithms and data structures, online algorithms, approximation algorithm, graphs, computational geometry, computational complexity, network, optimization and biology, combinatorial optimization and quantum computing, as well as distributed computing and cryptography.

作者簡介

暫缺《算法與計算:會議錄LNCS-4288 Algorithms and computation》作者簡介

圖書目錄

Invited Talks
 Stable Matching Problems
 Delaunay Meshing of Surfaces
Best Paper 2006
 Algorithmic Graph Minor Theory: Improved Grid Minor Bounds and Wagner's Contraction
Best Student Paper 2006
 Branching and Treewidth Based Exact Algorithms
Session 1A: Algorithms and Data Structures
 Deterministic Splitter Finding in a Stream with Constant Storage and Guarantees
 Optimal Algorithms for Tower of Hanoi Problems with Relaxed Placement Rules
 Flexible Word Design and Graph Labeling
Session 1B: Online Algorithms
 Frequency Allocation Problems for Linear Cellular Networks
 Finite-State Online Algorithms and Their Automated Competitive Analysis
 Offiine Sorting Buffers on Line
Session 2A: Approximation Algorithms
 Approximating Tree Edit Distance Through String Edit Distance
 A 6-Approximation Algorithm for Computing Smallest Common AoN-Supertree with Application to the Reconstruction of Glycan Trees
 Improved Approximation for Single-Sink Buy-at-Bulk
 Approximability of Partitioning Graphs with Supply and Demand
Session 2B: Graphs
 Convex Grid Drawings of Plane Graphs with Rectangular Contours
 Algorithms on Graphs with Small Dominating Targets
 Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems
 On Estimating Path Aggregates over Streaming Graphs
Session 3A: Computational Geometry
 Diamond Triangulations Contain Spanners of Bounded Degree
……
Author Index

本目錄推薦

掃描二維碼
Copyright ? 讀書網(wǎng) ranfinancial.com 2005-2020, All Rights Reserved.
鄂ICP備15019699號 鄂公網(wǎng)安備 42010302001612號