Algorithmic Aspects in Information and Management: 5th International Conference, AAIM 2009, San Francisco, CA, USA, June 15-17, 2009, Proceedings / Edition 1

by Andrew Goldberg, Yunhong Zhou

Overview

This book constitutes the proceedings of the 5th International Conference on Algorithmic Aspects in Information Management, AAIM 2009, held in San Francisco, CA, USA, in June 2009.

The 25 papers presented together with the abstracts of two invited talks were carefully reviewed and selected for inclusion in this book.

While the areas of information management and management science are full of algorithmic challenges, the proliferation of data (Internet, biology, finance etc) has called for the design of efficient and scalable algorithms and data structures for their management and processing. This conference is intended for original algorithmic research on immediate applications and/or fundamental problems pertinent to information management and management science, broadly construed. The conference aims at bringing together researchers in Computer Science, Operations Research, Economics, Game Theory, and related disciplines.

Product Details

ISBN-13:	9783642021572
Publisher:	Springer Berlin Heidelberg
Publication date:	06/30/2009
Series:	Lecture Notes in Computer Science , #5564
Edition description:	2009
Pages:	327
Product dimensions:	6.10(w) x 9.20(h) x 0.80(d)

Table of Contents

Algorithmic Challenge in Online Advertising.- Parallel Algorithms for Collaborative Filtering.- On the Approximability of Some Haplotyping Problems.- On Acyclicity of Games with Cycles.- Discrete online TSP.- On Approximating an Implicit Cover Problem in Biology.- Power Indices in Spanning Connectivity Games.- Efficiently Generating k-Best Solutions to Procurement Auctions.- Integer Polyhedra for Program Analysis.- Line Segment Facility Location in Weighted Subdivisions.- Algorithms for Placing Monitors in a Flow Network.- Three Results on Frequency Assignment in Linear Cellular Networks.- Link Distance and Shortest Path Problems in the Plane.- Orca Reduction and ContrAction Graph Clustering.- Equiseparability on Terminal Wiener Index.- Effective Tour Searching for TSP by Contraction of Pseudo Backbone Edges.- Optimal Auctions Capturing Constraints in Sponsored Search.- A Note on Estimating Hybrid Frequency Moment of Data Streams.- Two-Level Push-Relabel Algorithm for the Maximum Flow Problem.- A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing.- Dynamic Position Auctions with Consumer Search.- Nonlinear Optimization over a Weighted Independence System.- Improved Online Algorithms for Multiplexing Weighted Packets in Bounded Buffers.- Latency Constrained Aggregation in Chain Networks Admits a PTAS.- Cutting a Cake for Five People.- PLDA: Parallel Latent Dirichlet Allocation for Large-Scale Applications.- On Job Scheduling with Preemption Penalties.