↓ 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 Approximation and Online Algorithms
  3. Altmetric Badge
    Chapter 2 On the Minimum Load Coloring Problem
  4. Altmetric Badge
    Chapter 3 Improved Approximation Algorithms for MAX NAE-SAT and MAX SAT
  5. Altmetric Badge
    Chapter 4 The Hardness of Network Design for Unsplittable Flow with Selfish Users
  6. Altmetric Badge
    Chapter 5 Improved Approximation Algorithm for Convex Recoloring of Trees
  7. Altmetric Badge
    Chapter 6 Exploiting Locality: Approximating Sorting Buffers
  8. Altmetric Badge
    Chapter 7 Approximate Fair Cost Allocation in Metric Traveling Salesman Games
  9. Altmetric Badge
    Chapter 8 Rounding of Sequences and Matrices, with Applications
  10. Altmetric Badge
    Chapter 9 A Note on Semi-online Machine Covering
  11. Altmetric Badge
    Chapter 10 SONET ADMs Minimization with Divisible Paths
  12. Altmetric Badge
    Chapter 11 The Conference Call Search Problem in Wireless Networks
  13. Altmetric Badge
    Chapter 12 Improvements for Truthful Mechanisms with Verifiable One-Parameter Selfish Agents
  14. Altmetric Badge
    Chapter 13 Symmetry in Network Congestion Games: Pure Equilibria and Anarchy Cost
  15. Altmetric Badge
    Chapter 14 A Better-Than-Greedy Algorithm for k -Set Multicover
  16. Altmetric Badge
    Chapter 15 Deterministic Online Optical Call Admission Revisited
  17. Altmetric Badge
    Chapter 16 Scheduling Parallel Jobs with Linear Speedup
  18. Altmetric Badge
    Chapter 17 Online Removable Square Packing
  19. Altmetric Badge
    Chapter 18 The Online Target Date Assignment Problem
  20. Altmetric Badge
    Chapter 19 Approximation and Complexity of k –Splittable Flows
  21. Altmetric Badge
    Chapter 20 On Minimizing the Maximum Flow Time in the Online Dial-a-Ride Problem
  22. Altmetric Badge
    Chapter 21 Tighter Approximations for Maximum Induced Matchings in Regular Graphs
  23. Altmetric Badge
    Chapter 22 On Approximating Restricted Cycle Covers
  24. Altmetric Badge
    Chapter 23 A PTAS for the Minimum Dominating Set Problem in Unit Disk Graphs
  25. Altmetric Badge
    Chapter 24 Speed Scaling of Tasks with Precedence Constraints
  26. Altmetric Badge
    Chapter 25 Partial Multicuts in Trees
  27. Altmetric Badge
    Chapter 26 Approximation Schemes for Packing with Item Fragmentation
Attention for Chapter 26: Approximation Schemes for Packing with Item Fragmentation
Altmetric Badge

Mentioned by

wikipedia
1 Wikipedia page

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
3 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
Approximation Schemes for Packing with Item Fragmentation
Chapter number 26
Book title
Approximation and Online Algorithms
Published by
Springer, Berlin, Heidelberg, October 2005
DOI 10.1007/11671411_26
Book ISBNs
978-3-54-032207-8, 978-3-54-032208-5
Authors

Hadas Shachnai, Tami Tamir, Omer Yehezkely, Shachnai, Hadas, Tamir, Tami, Yehezkely, Omer

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 3 100%

Demographic breakdown

Readers by professional status Count As %
Professor 1 33%
Student > Doctoral Student 1 33%
Student > Master 1 33%
Readers by discipline Count As %
Mathematics 1 33%
Business, Management and Accounting 1 33%
Engineering 1 33%