↓ Skip to main content

Algorithmic Aspects in Information and Management

Overview of attention for book
Cover of 'Algorithmic Aspects in Information and Management'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Double Partition: (6 +  ε )-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs
  3. Altmetric Badge
    Chapter 2 Nash Bargaining Via Flexible Budget Markets
  4. Altmetric Badge
    Chapter 3 On the Minimum Hitting Set of Bundles Problem
  5. Altmetric Badge
    Chapter 4 Speed Scaling with a Solar Cell
  6. Altmetric Badge
    Chapter 5 Engineering Label-Constrained Shortest-Path Algorithms
  7. Altmetric Badge
    Chapter 6 New Upper Bounds on Continuous Tree Edge-Partition Problem
  8. Altmetric Badge
    Chapter 7 A Meeting Scheduling Problem Respecting Time and Space
  9. Altmetric Badge
    Chapter 8 Fixed-Parameter Algorithms for Kemeny Scores
  10. Altmetric Badge
    Chapter 9 The Distributed Wireless Gathering Problem
  11. Altmetric Badge
    Chapter 10 Approximating Maximum Edge 2-Coloring in Simple Graphs Via Local Improvement
  12. Altmetric Badge
    Chapter 11 An Improved Randomized Approximation Algorithm for Maximum Triangle Packing
  13. Altmetric Badge
    Chapter 12 Line Facility Location in Weighted Regions
  14. Altmetric Badge
    Chapter 13 Algorithms for Temperature-Aware Task Scheduling in Microprocessor Systems
  15. Altmetric Badge
    Chapter 14 Engineering Comparators for Graph Clusterings
  16. Altmetric Badge
    Chapter 15 On the Fast Searching Problem
  17. Altmetric Badge
    Chapter 16 Confidently Cutting a Cake into Approximately Fair Pieces
  18. Altmetric Badge
    Chapter 17 Copeland Voting Fully Resists Constructive Control
  19. Altmetric Badge
    Chapter 18 The Complexity of Power-Index Comparison
  20. Altmetric Badge
    Chapter 19 Facility Location Problems: A Parameterized View
  21. Altmetric Badge
    Chapter 20 Shortest Path Queries in Polygonal Domains
  22. Altmetric Badge
    Chapter 21 A Fast 2-Approximation Algorithm for the Minimum Manhattan Network Problem
  23. Altmetric Badge
    Chapter 22 Minimum Cost Homomorphism Dichotomy for Oriented Cycles
  24. Altmetric Badge
    Chapter 23 Minimum Leaf Out-Branching Problems
  25. Altmetric Badge
    Chapter 24 Graphs and Path Equilibria
  26. Altmetric Badge
    Chapter 25 No l Grid-Points in Spaces of Small Dimension
  27. Altmetric Badge
    Chapter 26 The Secret Santa Problem
  28. Altmetric Badge
    Chapter 27 Finding Optimal Refueling Policies in Transportation Networks
  29. Altmetric Badge
    Chapter 28 Scale Free Interval Graphs
  30. Altmetric Badge
    Chapter 29 On Representation of Planar Graphs by Segments
  31. Altmetric Badge
    Chapter 30 An Optimal On-Line Algorithm for Preemptive Scheduling on Two Uniform Machines in the ℓ p Norm
  32. Altmetric Badge
    Chapter 31 An Optimal Strategy for Online Non-uniform Length Order Scheduling
  33. Altmetric Badge
    Chapter 32 Large-Scale Parallel Collaborative Filtering for the Netflix Prize
Attention for Chapter 32: Large-Scale Parallel Collaborative Filtering for the Netflix Prize
Altmetric Badge

Mentioned by

twitter
1 X user

Citations

dimensions_citation
2 Dimensions

Readers on

mendeley
607 Mendeley
citeulike
1 CiteULike
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
Large-Scale Parallel Collaborative Filtering for the Netflix Prize
Chapter number 32
Book title
Algorithmic Aspects in Information and Management
Published by
Springer, Berlin, Heidelberg, June 2008
DOI 10.1007/978-3-540-68880-8_32
Book ISBNs
978-3-54-068865-5, 978-3-54-068880-8
Authors

Yunhong Zhou, Dennis Wilkinson, Robert Schreiber, Rong Pan, Zhou, Yunhong, Wilkinson, Dennis, Schreiber, Robert, Pan, Rong

X Demographics

X Demographics

The data shown below were collected from the profile of 1 X user who shared this research output. Click here to find out more about how the information was compiled.
Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 607 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
United States 16 3%
United Kingdom 11 2%
Germany 7 1%
China 5 <1%
Russia 3 <1%
Japan 3 <1%
Spain 3 <1%
Korea, Republic of 2 <1%
Brazil 2 <1%
Other 13 2%
Unknown 542 89%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 148 24%
Student > Master 144 24%
Researcher 72 12%
Other 50 8%
Student > Bachelor 42 7%
Other 76 13%
Unknown 75 12%
Readers by discipline Count As %
Computer Science 378 62%
Engineering 39 6%
Mathematics 30 5%
Business, Management and Accounting 12 2%
Agricultural and Biological Sciences 11 2%
Other 48 8%
Unknown 89 15%