TY  - BOOK
AU  - Goldberg,Andrew V.
AU  - Zhou,Yunhong
ED  - SpringerLink (Online service)
TI  - Algorithmic Aspects in Information and Management: 5th International Conference, AAIM 2009, San Francisco, CA, USA, June 15-17, 2009. Proceedings 
T2  - Lecture Notes in Computer Science,
SN  - 9783642021589
AV  - QA76.9.A43 
U1  - 005.1 23
PY  - 2009///
CY  - Berlin, Heidelberg
PB  - Springer Berlin Heidelberg
KW  - Computer science
KW  - Data structures (Computer science)
KW  - Computer software
KW  - Electronic data processing
KW  - Computational complexity
KW  - Computer Science
KW  - Algorithm Analysis and Problem Complexity
KW  - Discrete Mathematics in Computer Science
KW  - Data Structures
KW  - Numeric Computing
KW  - Mathematics of Computing
KW  - Mathematical Logic and Formal Languages
N1  - 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
UR  - http://dx.doi.org/10.1007/978-3-642-02158-9
ER  -