|
读过这本书吗?
最近在读
读过
想读
还不熟悉
|
图书城书列:
加入到博客或社交网站:
|
|
我来评论这本书:
内容提要:
This book constitutes the refereed proceedings of the 15th International Symposium on Algorithms and Computation, ISAAC 2004, held in Hong Kong, China in December 2004.
The 76 revised full papers presented were carefully reviewed and selected from 226 submissions. Among the topics addressed are computational geometry, graph computations, computational combinatorics, combinatorial optimization, computational complexity, scheduling, distributed algorithms, parallel algorithms, data structures, network optimization, randomized algorithms, and computational mathematics more generally. 目录:
Puzzles, Art, and Magic with Algorithms
The ABCs of AVDs: Geometric Retrieval Made Simple Pareto Optimality in House Allocation Problems Property-Preserving Data Reconstruction On the Monotone Circuit Complexity of Quadratic Boolean Functions Generalized Function Matching Approximate Distance Oracles for Graphs with Dense Clusters Multicriteria Global Minimum Cuts Polyline Fitting of Planar Points Under Min-sum Criteria A Generalization of Magic Squares with Applications to Digital Halftoning Voronoi Diagrams with a Transportation Network on the Euclidean Plane Structural Alignment of Two RNA Sequences with Lagrangian Relaxation Poly-APX- and PTAS-Completeness in Standard and Differential Approximation Efficient Algorithms for k Maximum Sums Equipartitions of Measures by 2-Fans Augmenting the Edge-Connectivity of a Spider Tree On Nash Equilibria for Multicast Transmissions in Ad-Hoc Wireless Networks Structural Similarity in Graphs (A Relaxation Approach for Role Assignment) Flexibility of Steiner Trees in Uniform Orientation Metrics Random Access to Advice Strings and Collapsing Results Bounding the Payment of Approximate Truthful Mechanisms The Polymatroid Steiner Problems Geometric Optimization Problems Over Sliding Windows On-Line Windows Scheduling of Temporary Items …… Author Index |