Algorithms and Computation 算法与计算

出版时间：2005-12  出版社：湖北辞书出版社  作者：Xiaotie Deng　著  页数：1190  

内容概要

This book constitutes the refereed proceedings of the 16th International Symposium on Algorithms and Computation, ISAAC 2005, held in Sanya, Hainan, China in December 2005. The 112 revised full papers presented were carefully reviewed and selected from 549 submissions. The papers are organized in topical sections on computational geometry, computational optimization, graph drawing and graph algorithms, computational complexity, approximation algorithms, internet algorithms, quantum computing and cryptography, data structure, computational biology, experimental algorithm mehodologies and online algorithms, randomized algorithms, parallel and distributed algorithms, graph drawing and graph algorithms, computational complexity, combinatorial optimization, computational biology, computational complexity, computational optimization, computational geometry, approximation algorithms, graph drawing and graph algorithms, computational geometry, approximation algorithms, graph drawing and graph algorithms, and data structure.

书籍目录

Algorithmic Problems in Wireless Ad Hoc NetworksProbability and RecursionEmbedding Point Sets into Plane Graphs of Small DilationThe Layered Net Surface Problems in Discrete Geometry and Medical:Image SegmentationSeparability with OutliersCasting an Object with a CoreSparse Geometric Graphs with Small DilationMultiple Polyline to Polygon MatchingMinimizing a Monotone Concave Function with Laminar Covering ConstraintsAlmost Optimal Solutions for Bin Coloring ProblemsGEN-LARAC: A Generalized Approach to the Constrained Shortest Path Problem Under Multiple Additive ConstraintsSimultaneous MatchingsAn Optimization Problem Related to VoD BroadcastingA Min-Max Relation on Packing Feedback Vertex SetsAverage Case Analysis for Tree Labelling SchemesRevisiting T. Uno and M. Yagiura's AlgorithmGenerating Cut Conjunctions and Bridge Avoiding Extensions in GraphsOrthogonal Drawings of Series-Parallel Graphs with Minimum BendsBisecting a Four-Connected Graph with Three Resource SetsLaminar Structure of Ptolemaic Graphs and Its ApplicationsOn the Complexity of the G-Reconstruction ProblemHybrid Voting Protocols and Hardness of ManipulationOn the Complexity of Rocchio's Similarity-Based Relevance Feedback AlgorithmCorrelation Clustering and Consensus ClusteringAn Approximation Algorithm for Scheduling Malleable Tasks Under General Precedence ConstraintsA 1.5-Approximation of the Minimal Manhattan Network Problem……Errata from ISAAC 2004(LNCS 3341)Author Index