My Library

University LibraryCatalogue

For faster,
simpler
access.
Use Lean
Library.
Get it now
Don't show me again

LEADER 00000cam a2200601Ia 4500 
003    OCoLC 
005    20160625033033.7 
006    m     o  d         
007    cr cn||||||||| 
008    090824s2009    gw a    ob    101 0 eng d 
019    SPRINGERocn432703040 
020    9783642021589 
020    3642021581 
020    |z9783642021572 
020    |z3642021573 
037    978-3-642-02157-2|bSpringer|nhttp://www.springerlink.com 
040    GW5XE|beng|epn|cGW5XE|dWAU|dOCLCQ|dCUS|dGZM|dC$Q|dIXA|dCOO
       |dOCLCQ|dOCLCF|dBEDGE|dOHS|dOCLCQ|dOCLCA|dSLY|dOCLCO|dA7U
       |dYDXCP|dIDEBK|dNUI|dOCL|dOCLCO|dEBLCP|dOCLCQ|dOCLCO
       |dOCLCQ|dOCLCO|dOCLCQ 
049    MAIN 
050  4 QA76.9.A43|bA25 2009 
060  4 QA 76.9.A43 
082 04 005.1|222 
111 2  AAIM (Conference)|n(5th :|d2009 :|cSan Francisco, Calif.) 
245 10 Algorithmic aspects in information and management :|b5th 
       international conference, AAIM 2009, San Francisco, CA, 
       USA, June 15-17, 2009 : proceedings /|cAndrew V. Goldberg,
       Yunhong Zhou (eds.). 
260    Berlin ;|aNew York :|bSpringer,|c©2009. 
300    1 online resource (x, 325 pages) :|billustrations. 
336    text|btxt|2rdacontent 
337    computer|bc|2rdamedia 
338    online resource|bcr|2rdacarrier 
490 1  Lectures notes in computer science,|x0302-9743 ;|v5564 
504    Includes bibliographical references and index. 
505 0  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. 
520    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.
650  0 Computer algorithms|vCongresses. 
650  0 Management science|xMathematical models|vCongresses. 
655  2 Congresses. 
655  4 Electronic books. 
655  7 Conference papers and proceedings.|2fast
       |0(OCoLC)fst01423772 
700 1  Goldberg, Andrew V. 
700 1  Zhou, Yunhong. 
710 2  SpringerLink|eissuing body. 
776 08 |iPrint version:|aAAIM 2009 (2009 : San Francisco, 
       Calif.).|tAlgorithmic aspects in information and 
       management.|dBerlin ; New York : Springer, ©2009
       |z9783642021572|z3642021573|w(OCoLC)401153829 
830  0 Lecture notes in computer science ;|v5564. 
830  0 Springer Lecture Notes in Computer Science 
856 40 |uhttps://ezp.lib.unimelb.edu.au/login?url=http://
       link.springer.com/10.1007/978-3-642-02158-9|zConnect to 
       ebook (University of Melbourne only) 
990    Springer Lecture Notes In Computer Science 
990    Batch Ebook load (bud2) - do not edit, delete or attach 
       any records. 
991    |zNEW  2016-06-25 
Location Call No. Status
 UniM INTERNET resource    AVAILABLE