↓ Skip to main content

Approximation and Online Algorithms

Overview of attention for book
Cover of 'Approximation and Online Algorithms'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Pricing Commodities, or How to Sell When Buyers Have Restricted Valuations
  3. Altmetric Badge
    Chapter 2 Improved Lower Bounds for Non-utilitarian Truthfulness
  4. Altmetric Badge
    Chapter 3 Buyer-Supplier Games: Optimization over the Core
  5. Altmetric Badge
    Chapter 4 Very Large-Scale Neighborhoods with Performance Guarantees for Minimizing Makespan on Parallel Machines
  6. Altmetric Badge
    Chapter 5 A 3/2-Approximation for the Proportionate Two-Machine Flow Shop Scheduling with Minimum Delays
  7. Altmetric Badge
    Chapter 6 Online Algorithm for Parallel Job Scheduling and Strip Packing
  8. Altmetric Badge
    Chapter 7 Geometric Spanners with Small Chromatic Number
  9. Altmetric Badge
    Chapter 8 Approximating Largest Convex Hulls for Imprecise Points
  10. Altmetric Badge
    Chapter 9 A 2-Approximation Algorithm for the Metric 2-Peripatetic Salesman Problem
  11. Altmetric Badge
    Chapter 10 Covering the Edges of Bipartite Graphs Using K 2,2 Graphs
  12. Altmetric Badge
    Chapter 11 On Min-Max r -Gatherings
  13. Altmetric Badge
    Chapter 12 On the Max Coloring Problem
  14. Altmetric Badge
    Chapter 13 Full and Local Information in Distributed Decision Making
  15. Altmetric Badge
    Chapter 14 The Minimum Substring Cover Problem
  16. Altmetric Badge
    Chapter 15 A 5/3-Approximation for Finding Spanning Trees with Many Leaves in Cubic Graphs
  17. Altmetric Badge
    Chapter 16 On the Online Unit Clustering Problem
  18. Altmetric Badge
    Chapter 17 Better Bounds for Incremental Medians
  19. Altmetric Badge
    Chapter 18 Minimum Weighted Sum Bin Packing
  20. Altmetric Badge
    Chapter 19 Approximation Schemes for Packing Splittable Items with Cardinality Constraints
  21. Altmetric Badge
    Chapter 20 A Randomized Algorithm for Two Servers in Cross Polytope Spaces
  22. Altmetric Badge
    Chapter 21 Deterministic Algorithms for Rank Aggregation and Other Ranking and Clustering Problems
  23. Altmetric Badge
    Chapter 22 Online Rectangle Filling
Attention for Chapter 16: On the Online Unit Clustering Problem
Altmetric Badge

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
4 Mendeley
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
On the Online Unit Clustering Problem
Chapter number 16
Book title
Approximation and Online Algorithms
Published by
Springer, Berlin, Heidelberg, October 2007
DOI 10.1007/978-3-540-77918-6_16
Book ISBNs
978-3-54-077917-9, 978-3-54-077918-6
Authors

Leah Epstein, Rob van Stee, Epstein, Leah, van Stee, Rob

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 4 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 1 25%
Professor > Associate Professor 1 25%
Researcher 1 25%
Other 1 25%
Readers by discipline Count As %
Computer Science 3 75%
Unknown 1 25%