算法与计算/会议录LNCS-4288:Algorithms and computation
点此进入淘宝搜索页搜索分类: 图书,计算机/网络,计算机理论,
作者： Tetsuo Asano 著
出 版 社： 湖南文艺出版社
出版时间： 2006-12-1字数：版次： 1页数： 766印刷时间： 2006/12/01开本：印次：纸张： 胶版纸I S B N ： 9783540496946包装： 平装编辑推荐
The LNCS series reports state-of-the-art results in computer science research，development，and education，at a high level and in both printed and electronic form. Enjoying tight cooperation with the R&D community，with numerous individuals，as well as with prestigious organizations and societies，LNCS has grown into the most comprehensive computer science research forum available.
The scope of LNCS，including its subseries LNAI，spans the whole range of computer science and information technology including interdisciplinary topics in a variety of application fields. The type of material published traditionally includes.
—proceedings （published in time for the respective conference）
—post-proceedings （consisting of thoroughly revised final full papers）
—research monographs（which may be based on outstanding PhD work，research projects，technical reports，etc.）.
内容简介
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.
目录
Invited Talks
Stable Matching Problems
Delaunay Meshing of Surfaces
Best Paper 2006
Algorithmic Graph Minor Theory: Improved Grid Minor Boundsand 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 Storageand Guarantees
Optimal Algorithms for Tower of Hanoi Problems with RelaxedPlacement 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 CompetitiveAnalysis
Offiine Sorting Buffers on Line
Session 2A: Approximation Algorithms
Approximating Tree Edit Distance Through String Edit Distance
A 6-Approximation Algorithm for Computing Smallest CommonAoN-Supertree with Application to the Reconstructionof 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 Matchingsand Related Problems
On Estimating Path Aggregates over Streaming Graphs
Session 3A: Computational Geometry
Diamond Triangulations Contain Spanners of Bounded Degree
……
Author Index
