↓ Skip to main content
What is this page? Embed badge

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

Overview of attention for book
Cover of 'Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Spectral Sparsification in Dynamic Graph Streams
  3. Altmetric Badge
    Chapter 2 The Online Stochastic Generalized Assignment Problem
  4. Altmetric Badge
    Chapter 3 Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
  5. Altmetric Badge
    Chapter 4 Approximating Large Frequency Moments with Pick-and-Drop Sampling
  6. Altmetric Badge
    Chapter 5 Generalizing the Layering Method of Indyk and Woodruff: Recursive Sketches for Frequency-Based Vectors on Streams
  7. Altmetric Badge
    Chapter 6 Capacitated Network Design on Undirected Graphs
  8. Altmetric Badge
    Chapter 7 Scheduling Subset Tests: One-Time, Continuous, and How They Relate
  9. Altmetric Badge
    Chapter 8 On the Total Perimeter of Homothetic Convex Bodies in a Convex Container
  10. Altmetric Badge
    Chapter 9 Partial Interval Set Cover – Trade-Offs between Scalability and Optimality
  11. Altmetric Badge
    Chapter 10 Online Square-into-Square Packing
  12. Altmetric Badge
    Chapter 11 Online Non-clairvoyant Scheduling to Simultaneously Minimize All Convex Functions
  13. Altmetric Badge
    Chapter 12 Shrinking Maxima, Decreasing Costs: New Online Packing and Covering Problems
  14. Altmetric Badge
    Chapter 13 Multiple Traveling Salesmen in Asymmetric Metrics
  15. Altmetric Badge
    Chapter 14 Approximate Indexability and Bandit Problems with Concave Rewards and Delayed Feedback
  16. Altmetric Badge
    Chapter 15 The Approximability of the Binary Paintshop Problem
  17. Altmetric Badge
    Chapter 16 Approximation Algorithms for Movement Repairmen
  18. Altmetric Badge
    Chapter 17 Improved Hardness of Approximating Chromatic Number
  19. Altmetric Badge
    Chapter 18 A Pseudo-approximation for the Genus of Hamiltonian Graphs
  20. Altmetric Badge
    Chapter 19 A Local Computation Approximation Scheme to Maximum Matching
  21. Altmetric Badge
    Chapter 20 Sketching Earth-Mover Distance on Graph Metrics
  22. Altmetric Badge
    Chapter 21 Online Multidimensional Load Balancing
  23. Altmetric Badge
    Chapter 22 A New Regularity Lemma and Faster Approximation Algorithms for Low Threshold Rank Graphs
  24. Altmetric Badge
    Chapter 23 Interdiction Problems on Planar Graphs
  25. Altmetric Badge
    Chapter 24 Conditional Random Fields, Planted Constraint Satisfaction and Entropy Concentration
  26. Altmetric Badge
    Chapter 25 Finding Heavy Hitters from Lossy or Noisy Data
  27. Altmetric Badge
    Chapter 26 Private Learning and Sanitization: Pure vs. Approximate Differential Privacy
  28. Altmetric Badge
    Chapter 27 Phase Coexistence and Slow Mixing for the Hard-Core Model on ℤ 2
  29. Altmetric Badge
    Chapter 28 Fast Private Data Release Algorithms for Sparse Queries
  30. Altmetric Badge
    Chapter 29 Local Reconstructors and Tolerant Testers for Connectivity and Diameter
  31. Altmetric Badge
    Chapter 30 An Optimal Lower Bound for Monotonicity Testing over Hypergrids
  32. Altmetric Badge
    Chapter 31 Small-Bias Sets for Nonabelian Groups
  33. Altmetric Badge
    Chapter 32 What You Can Do with Coordinated Samples
  34. Altmetric Badge
    Chapter 33 Robust Randomness Amplifiers: Upper and Lower Bounds
  35. Altmetric Badge
    Chapter 34 The Power of Choice for Random Satisfiability
  36. Altmetric Badge
    Chapter 35 Connectivity of Random High Dimensional Geometric Graphs
  37. Altmetric Badge
    Chapter 36 Matching-Vector Families and LDCs over Large Modulo
  38. Altmetric Badge
    Chapter 37 Explicit Noether Normalization for Simultaneous Conjugation via Polynomial Identity Testing
  39. Altmetric Badge
    Chapter 38 Testing Membership in Counter Automaton Languages
  40. Altmetric Badge
    Chapter 39 Tight Lower Bounds for Testing Linear Isomorphism
  41. Altmetric Badge
    Chapter 40 Randomness-Efficient Curve Samplers
  42. Altmetric Badge
    Chapter 41 Combinatorial Limitations of Average-Radius List Decoding
  43. Altmetric Badge
    Chapter 42 Zero Knowledge LTCs and Their Applications
  44. Altmetric Badge
    Chapter 43 A Tight Lower Bound for High Frequency Moment Estimation with Small Error
  45. Altmetric Badge
    Chapter 44 Improved FPTAS for Multi-spin Systems
  46. Altmetric Badge
    Chapter 45 Pseudorandomness for Regular Branching Programs via Fourier Analysis
  47. Altmetric Badge
    Chapter 46 Absolutely Sound Testing of Lifted Codes
  48. Altmetric Badge
    Chapter 47 On the Average Sensitivity and Density of k -CNF Formulas
  49. Altmetric Badge
    Chapter 48 Improved Bounds on the Phase Transition for the Hard-Core Model in 2-Dimensions
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

q&a
1 Q&A thread

Citations

dimensions_citation
5 Dimensions

Readers on

mendeley
63 Mendeley
Summary Q&A Dimensions citations
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, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Published by
Springer Berlin Heidelberg, August 2013
DOI 10.1007/978-3-642-40328-6
ISBNs
978-3-64-240327-9, 978-3-64-240328-6
Editors

Raghavendra, Prasad, Raskhodnikova, Sofya, Jansen, Klaus, Rolim, José D. P.

View on publisher site

This page is provided by Altmetric.