↓ Skip to main content

Approximation Algorithms for Combinatorial Optimization

Overview of attention for book
Cover of 'Approximation Algorithms for Combinatorial Optimization'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Approximation Algorithms That Take Advice
  3. Altmetric Badge
    Chapter 2 Instant Recognition of Polynomial Time Solvability, Half Integrality, and 2-Approximations
  4. Altmetric Badge
    Chapter 3 Scheduling under Uncertainty: Optimizing against a Randomizing Adversary
  5. Altmetric Badge
    Chapter 4 Approximation Algorithms for Facility Location Problems
  6. Altmetric Badge
    Chapter 5 An Approximation Algorithm for MAX DICUT with Given Sizes of Parts
  7. Altmetric Badge
    Chapter 6 Maximizing Job Benefits On-Line
  8. Altmetric Badge
    Chapter 7 Variable Length Sequencing with Two Lengths
  9. Altmetric Badge
    Chapter 8 Randomized Path Coloring on Binary Trees
  10. Altmetric Badge
    Chapter 9 Wavelength Rerouting in Optical Networks, or the Venetian Routing Problem
  11. Altmetric Badge
    Chapter 10 Greedy Approximation Algorithms for Finding Dense Components in a Graph
  12. Altmetric Badge
    Chapter 11 Online Real-Time Preemptive Scheduling of Jobs with Deadlines
  13. Altmetric Badge
    Chapter 12 On the Relative Complexity of Approximate Counting Problems
  14. Altmetric Badge
    Chapter 13 On the Hardness of Approximating NP Witnesses
  15. Altmetric Badge
    Chapter 14 Maximum Dispersion and Geometric Maximum Weight Cliques
  16. Altmetric Badge
    Chapter 15 New Results for Online Page Replication
  17. Altmetric Badge
    Chapter 16 Inapproximability Results for Set Splitting and Satisfiability Problems with No Mixed Clauses
  18. Altmetric Badge
    Chapter 17 Approximation Algorithms for a Capacitated Network Design Problem
  19. Altmetric Badge
    Chapter 18 An Approximation Algorithm for the Fault Tolerant Metric Facility Location Problem
  20. Altmetric Badge
    Chapter 19 Improved Approximations for Tour and Tree Covers
  21. Altmetric Badge
    Chapter 20 Approximating Node Connectivity Problems via Set Covers
  22. Altmetric Badge
    Chapter 21 Rectangle Tiling
  23. Altmetric Badge
    Chapter 22 Primal-Dual Approaches to the Steiner Problem
  24. Altmetric Badge
    Chapter 23 On the Inapproximability of Broadcasting Time
  25. Altmetric Badge
    Chapter 24 Polynomial Time Approximation Schemes for Class-Constrained Packing Problems
  26. Altmetric Badge
    Chapter 25 Partial Servicing of On-Line Jobs
  27. Altmetric Badge
    Chapter 26 Factor 4/3 Approximations for Minimum 2-Connected Subgraphs
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

patent
1 patent
wikipedia
1 Wikipedia page

Citations

dimensions_citation
12 Dimensions

Readers on

mendeley
2 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.
Title
Approximation Algorithms for Combinatorial Optimization
Published by
Springer Science & Business Media, August 2000
DOI 10.1007/3-540-44436-x
ISBNs
978-3-54-067996-7, 978-3-54-044436-7
Editors

Jansen, Klaus, Khuller, Samir

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 2 100%

Demographic breakdown

Readers by professional status Count As %
Unspecified 1 50%
Unknown 1 50%
Readers by discipline Count As %
Unspecified 1 50%
Unknown 1 50%