↓ 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 Some Easy and Some Not so Easy Geometric Optimization Problems
  3. Altmetric Badge
    Chapter 2 Deterministic Min-Cost Matching with Delays
  4. Altmetric Badge
    Chapter 3 Sequential Metric Dimension
  5. Altmetric Badge
    Chapter 4 A Primal-Dual Online Deterministic Algorithm for Matching with Delays
  6. Altmetric Badge
    Chapter 5 Advice Complexity of Priority Algorithms
  7. Altmetric Badge
    Chapter 6 Approximating Node-Weighted k -MST on Planar Graphs
  8. Altmetric Badge
    Chapter 7 Exploring Sparse Graphs with Advice (Extended Abstract)
  9. Altmetric Badge
    Chapter 8 Call Admission Problems on Grids with Advice (Extended Abstract)
  10. Altmetric Badge
    Chapter 9 Improved Approximation Algorithms for Minimum Power Covering Problems
  11. Altmetric Badge
    Chapter 10 DISPATCH: An Optimally-Competitive Algorithm for Maximum Online Perfect Bipartite Matching with i.i.d. Arrivals
  12. Altmetric Badge
    Chapter 11 Strategic Contention Resolution in Multiple Channels
  13. Altmetric Badge
    Chapter 12 Sublinear Graph Augmentation for Fast Query Implementation
  14. Altmetric Badge
    Chapter 13 Bin Packing Games with Weight Decision: How to Get a Small Value for the Price of Anarchy
  15. Altmetric Badge
    Chapter 14 Probabilistic Embeddings of the Fréchet Distance
  16. Altmetric Badge
    Chapter 15 Algorithms for Dynamic NFV Workload
  17. Altmetric Badge
    Chapter 16 Longest Increasing Subsequence Under Persistent Comparison Errors
  18. Altmetric Badge
    Chapter 17 Cut Sparsifiers for Balanced Digraphs
  19. Altmetric Badge
    Chapter 18 Reconfiguration of Graphs with Connectivity Constraints
  20. Altmetric Badge
    Chapter 19 The Itinerant List Update Problem
  21. Altmetric Badge
    Chapter 20 The Price of Fixed Assignments in Stochastic Extensible Bin Packing
Attention for Chapter 17: Cut Sparsifiers for Balanced Digraphs
Altmetric Badge

Citations

dimensions_citation
1 Dimensions
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
Cut Sparsifiers for Balanced Digraphs
Chapter number 17
Book title
Approximation and Online Algorithms
Published by
Springer, Cham, August 2018
DOI 10.1007/978-3-030-04693-4_17
Book ISBNs
978-3-03-004692-7, 978-3-03-004693-4
Authors

Motoki Ikeda, Shin-ichi Tanigawa, Ikeda, Motoki, Tanigawa, Shin-ichi