1 option
Algorithmic Aspects in Information and Management : 5th International Conference, AAIM 2009, San Francisco, CA, USA, June 15-17, 2009, Proceedings / edited by Andrew Goldberg, Yunhong Zhou.
SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online
View online- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- LNCS sublibrary. Information systems and applications, incl. Internet/Web, and HCI ; SL 3, 5564.
- Information Systems and Applications, incl. Internet/Web, and HCI ; 5564
- Language:
- English
- Subjects (All):
- Computer programming.
- Algorithms.
- Computer science--Mathematics.
- Computer science.
- Data structures (Computer science).
- Numerical analysis.
- Programming Techniques.
- Algorithm Analysis and Problem Complexity.
- Discrete Mathematics in Computer Science.
- Data Structures.
- Numeric Computing.
- Mathematics of Computing.
- Local Subjects:
- Programming Techniques.
- Algorithm Analysis and Problem Complexity.
- Discrete Mathematics in Computer Science.
- Data Structures.
- Numeric Computing.
- Mathematics of Computing.
- Physical Description:
- 1 online resource (X, 327 pages).
- Edition:
- First edition 2009.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2009.
- System Details:
- text file PDF
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-642-02158-9
- 9783642021589
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.