This book constitutes the refereed proceedings of the 4th International Conference on Algorithmic Aspects in Information and Management, AAIM 2008, held in Shanghai, China, in June 2008.
The 30 revised full papers presented together with abstracts of 2 invited talks were carefully reviewed and selected from 53 submissions. The papers cover original algorithmic research on immediate applications and/or fundamental problems pertinent to information management and management science. Topics addressed are: approximation algorithms, geometric data management, biological data management, graph algorithms, computational finance, mechanism design, computational game theory, network optimization, data structures, operations research, discrete optimization, online algorithms, FPT algorithms, and scheduling algorithms.
Author(s): Ding-Zhu Du (auth.), Rudolf Fleischer, Jinhui Xu (eds.)
Series: Lecture Notes in Computer Science 5034 : Information Systems and Applications, incl. Internet/Web, and HCI
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2008
Language: English
Pages: 352
Tags: Algorithm Analysis and Problem Complexity; Data Structures; Discrete Mathematics in Computer Science; Numeric Computing; Probability and Statistics in Computer Science; Management/Business for Professionals
Front Matter....Pages -
Double Partition: (6 + ε )-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs....Pages 1-1
Nash Bargaining Via Flexible Budget Markets....Pages 2-2
On the Minimum Hitting Set of Bundles Problem....Pages 3-14
Speed Scaling with a Solar Cell....Pages 15-26
Engineering Label-Constrained Shortest-Path Algorithms....Pages 27-37
New Upper Bounds on Continuous Tree Edge-Partition Problem....Pages 38-49
A Meeting Scheduling Problem Respecting Time and Space....Pages 50-59
Fixed-Parameter Algorithms for Kemeny Scores....Pages 60-71
The Distributed Wireless Gathering Problem....Pages 72-83
Approximating Maximum Edge 2-Coloring in Simple Graphs Via Local Improvement....Pages 84-96
An Improved Randomized Approximation Algorithm for Maximum Triangle Packing....Pages 97-108
Line Facility Location in Weighted Regions....Pages 109-119
Algorithms for Temperature-Aware Task Scheduling in Microprocessor Systems....Pages 120-130
Engineering Comparators for Graph Clusterings....Pages 131-142
On the Fast Searching Problem....Pages 143-154
Confidently Cutting a Cake into Approximately Fair Pieces....Pages 155-164
Copeland Voting Fully Resists Constructive Control....Pages 165-176
The Complexity of Power-Index Comparison....Pages 177-187
Facility Location Problems: A Parameterized View....Pages 188-199
Shortest Path Queries in Polygonal Domains....Pages 200-211
A Fast 2-Approximation Algorithm for the Minimum Manhattan Network Problem....Pages 212-223
Minimum Cost Homomorphism Dichotomy for Oriented Cycles....Pages 224-234
Minimum Leaf Out-Branching Problems....Pages 235-246
Graphs and Path Equilibria....Pages 247-258
No l Grid-Points in Spaces of Small Dimension....Pages 259-270
The Secret Santa Problem....Pages 271-279
Finding Optimal Refueling Policies in Transportation Networks....Pages 280-291
Scale Free Interval Graphs....Pages 292-303
On Representation of Planar Graphs by Segments....Pages 304-315
An Optimal On-Line Algorithm for Preemptive Scheduling on Two Uniform Machines in the ℓ p Norm....Pages 316-327
An Optimal Strategy for Online Non-uniform Length Order Scheduling....Pages 328-336
Large-Scale Parallel Collaborative Filtering for the Netflix Prize....Pages 337-348
Back Matter....Pages -
