微信扫一扫,移动浏览光盘
简介
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 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
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
算法与计算/会议录LNCS-4288:Algorithms and computation
- 名称
- 类型
- 大小
光盘服务联系方式: 020-38250260 客服QQ：4006604884
云图客服：
用户发送的提问，这种方式就需要有位在线客服来回答用户的问题，这种 就属于对话式的,问题是这种提问是否需要用户登录才能提问
Video Player
×
Audio Player
×
pdf Player
×
