Advertisement

Table of contents

  1. Front Matter
    PDF
  2. Algorithmic Challenge in Online Advertising
    Andrei Z. Broder
    Pages 1-1
    PDF
  3. Parallel Algorithms for Collaborative Filtering
    Edward Y. Chang
    Pages 2-2
    PDF
  4. On the Approximability of Some Haplotyping Problems
    John Abraham, Zhixiang Chen, Richard Fowler, Bin Fu, Binhai Zhu
    Pages 3-14
  5. On Acyclicity of Games with Cycles
    Daniel Andersson, Vladimir Gurvich, Thomas Dueholm Hansen
    Pages 15-28
  6. Discrete online TSP
    Mauro Aprea, Esteban Feuerstein, Gustavo Sadovoy, Alejandro Strejilevich de Loma
    Pages 29-42
  7. On Approximating an Implicit Cover Problem in Biology
    Mary V. Ashley, Tanya Y. Berger-Wolf, Wanpracha Chaovalitwongse, Bhaskar DasGupta, Ashfaq Khokhar, Saad Sheikh
    Pages 43-54
  8. Power Indices in Spanning Connectivity Games
    Haris Aziz, Oded Lachish, Mike Paterson, Rahul Savani
    Pages 55-67
  9. Efficiently Generating k-Best Solutions to Procurement Auctions
    Andrew Byde, Terence Kelly, Yunhong Zhou, Robert Tarjan
    Pages 68-84
  10. Integer Polyhedra for Program Analysis
    Philip J. Charles, Jacob M. Howe, Andy King
    Pages 85-99
  11. Line Segment Facility Location in Weighted Subdivisions
    Yam Ki Cheung, Ovidiu Daescu
    Pages 100-113
  12. Algorithms for Placing Monitors in a Flow Network
    Francis Chin, Marek Chrobak, Li Yan
    Pages 114-128
  13. Three Results on Frequency Assignment in Linear Cellular Networks
    Marek Chrobak, Jiří Sgall
    Pages 129-139
  14. Link Distance and Shortest Path Problems in the Plane
    Atlas F. Cook IV, Carola Wenk
    Pages 140-151
  15. Orca Reduction and ContrAction Graph Clustering
    Daniel Delling, Robert Görke, Christian Schulz, Dorothea Wagner
    Pages 152-165
  16. Equiseparability on Terminal Wiener Index
    Xiaotie Deng, Jie Zhang
    Pages 166-174
  17. Effective Tour Searching for TSP by Contraction of Pseudo Backbone Edges
    Changxing Dong, Gerold Jäger, Dirk Richter, Paul Molitor
    Pages 175-187
  18. Optimal Auctions Capturing Constraints in Sponsored Search
    Esteban Feuerstein, Pablo Ariel Heiber, Matías Lopez-Rosenfeld, Marcelo Mydlarz
    Pages 188-201
  19. A Note on Estimating Hybrid Frequency Moment of Data Streams
    Sumit Ganguly
    Pages 202-211
  20. Two-Level Push-Relabel Algorithm for the Maximum Flow Problem
    Andrew V. Goldberg
    Pages 212-225
  21. A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing
    Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann
    Pages 226-239
  22. Dynamic Position Auctions with Consumer Search
    Scott Duke Kominers
    Pages 240-250
  23. Nonlinear Optimization over a Weighted Independence System
    Jon Lee, Shmuel Onn, Robert Weismantel
    Pages 251-264
  24. Improved Online Algorithms for Multiplexing Weighted Packets in Bounded Buffers
    Fei Li
    Pages 265-278
  25. Latency Constrained Aggregation in Chain Networks Admits a PTAS
    Tim Nonner, Alexander Souza
    Pages 279-291
  26. Cutting a Cake for Five People
    Amin Saberi, Ying Wang
    Pages 292-300
  27. PLDA: Parallel Latent Dirichlet Allocation for Large-Scale Applications
    Yi Wang, Hongjie Bai, Matt Stanton, Wen-Yen Chen, Edward Y. Chang
    Pages 301-314
  28. On Job Scheduling with Preemption Penalties
    Feifeng Zheng, Yinfeng Xu, Chung Keung Poon
    Pages 315-325
  29. Back Matter
    PDF

About these proceedings

Keywords

Internet algorithms computer science data structure data structures game theory information management management operations research

Editors and affiliations

  • Andrew V. Goldberg
    • 1
  • Yunhong Zhou
    • 2
  1. 1.Microsoft Research – Silicon ValleyUSA
  2. 2.Rocket Fuel Inc.Marina Park CenterUSA

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-02158-9
  • Copyright Information Springer-Verlag Berlin Heidelberg 2009
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-02157-2
  • Online ISBN 978-3-642-02158-9
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site