信息和管理的算法方面LNCS-4041: Algorithmic aspects in information and management

This book constitutes the refereed proceedings of the Second International Conference on Algorithmic Aspects in Information and Management, AAIM 2006, held in Hong Kong, China in June 2006.
The 34 revised full papers presented together with abstracts of 2 invited talks were carefully reviewed and selected from 263 submissions. The papers cover topics from areas such as online scheduling, game and finance, data structures and algorithms, computational geometry, optimization, graph, and string.

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 sub series 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.）

Invited Papers
　Further Reflections on a Theory for Basic Algorithms
　Algorithmic DNA Self-assembly
Contributed Papers
　Online Scheduling on Parallel Machines with Two GoS Levels
　Online Dial-A-Ride Problem with Time-Windows Under a Restricted　Information Model
　Online Scheduling with Hard Deadlines on Parallel Machines
　Maximizing the Throughput of Multiple Machines On-Line
　Lattice Embedding of Direction-Preserving Correspondence over　Integrally Convex Set
　Linear Programming Polytope and Algorithm for Mean Payoff Games
　Atomic Routing Games on Maximum Congestion
　Equilibrium Distribution of Advertising Prices
　Finding Faithful Boyce-Codd Normal Form Decompositions
　Instant Service Policy and Its Application to Deficit Round Robin
　A Compression-Boosting Transform for Two-Dimensional Data
　Non-metric Multicommodity and Multilevel Facility Location
　Sublinear Time Width-Bounded Separators and Their Application　to the Protein Side-Chain Packing Problem
　Polygonal Curve Approximation Using Grid Points with Application
　to a Triangular Mesh Generation with Small Number of Different Edge　Lengths
　Distributions of Points and Large Convex Hulls of k Points
　Throwing Stones Inside Simple Polygons
　Some Basics on Tolerances
　Note on a Class of Admission Control Policies for the Stochastic　Knapsack Problem
　Inverse Bottleneck Optimization Problems on Networks
　 An Efficient Algorithm for Evacuation Problems in Dynamic Network Flows with Uniform Arc Capacity
　Connected Set Cover Problem and Its Applications
　A Branch and Bound Algorithm for Exact, Upper, and Lower Bounds on Treewidth
……
Author Index