↓ Skip to main content

Algorithms — ESA '95

Overview of attention for book
Cover of 'Algorithms — ESA '95'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 130 On mixed connectivity certificates
  3. Altmetric Badge
    Chapter 131 Truly efficient parallel algorithms: c-optimal multisearch for an extension of the BSP model
  4. Altmetric Badge
    Chapter 132 Optimal parallel shortest paths in small treewidth digraphs
  5. Altmetric Badge
    Chapter 133 Shared memory simulations with triple-logarithmic delay
  6. Altmetric Badge
    Chapter 134 Implementing shared memory on multi-dimensional meshes and on the fat-tree
  7. Altmetric Badge
    Chapter 135 Beyond the worst-case bisection bound: Fast sorting and ranking on meshes
  8. Altmetric Badge
    Chapter 136 Fast deterministic simulation of computations on faulty parallel machines
  9. Altmetric Badge
    Chapter 137 Average circuit depth and average communication complexity
  10. Altmetric Badge
    Chapter 138 Packing trees
  11. Altmetric Badge
    Chapter 139 Sometimes travelling is easy: The master tour problem
  12. Altmetric Badge
    Chapter 140 Interval graphs with side (and size) constraints
  13. Altmetric Badge
    Chapter 141 Maximum skew-symmetric flows
  14. Altmetric Badge
    Chapter 142 Certificates and fast algorithms for biconnectivity in fully-dynamic graphs
  15. Altmetric Badge
    Chapter 143 On the all-pairs shortest path algorithm of Moffat and Takaoka
  16. Altmetric Badge
    Chapter 144 Fully Dynamic Transitive Closure in plane dags with one source and one sink
  17. Altmetric Badge
    Chapter 145 Planarity for clustered graphs
  18. Altmetric Badge
    Chapter 146 A geometric approach to betweenness
  19. Altmetric Badge
    Chapter 147 Efficient computation of the geodesic Voronoi diagram of points in a simple polygon
  20. Altmetric Badge
    Chapter 148 Linear size binary space partitions for fat objects
  21. Altmetric Badge
    Chapter 149 Geometric pattern matching in d -dimensional space
  22. Altmetric Badge
    Chapter 150 Finding the constrained Delaunay triangulation and constrained Voronoi diagram of a simple polygon in linear-time
  23. Altmetric Badge
    Chapter 151 External-memory algorithms for processing line segments in geographic information systems
  24. Altmetric Badge
    Chapter 152 Optimized binary search and text retrieval
  25. Altmetric Badge
    Chapter 153 On using q -gram locations in approximate string matching
  26. Altmetric Badge
    Chapter 154 Routing with bounded buffers and hot-potato routing in vertex-symmetric networks
  27. Altmetric Badge
    Chapter 155 Load balancing for response time
  28. Altmetric Badge
    Chapter 156 Self-simulation for the Passive Optical Star model
  29. Altmetric Badge
    Chapter 157 Computing the agreement of trees with bounded degrees
  30. Altmetric Badge
    Chapter 158 Approximation algorithms for feasible cut and multicut problems
  31. Altmetric Badge
    Chapter 159 On parallel versus sequential approximation
  32. Altmetric Badge
    Chapter 160 An efficient and effective approximation algorithm for the Map Labeling Problem
  33. Altmetric Badge
    Chapter 161 Approximating the bandwidth for asteroidal triple-free graphs
  34. Altmetric Badge
    Chapter 162 Near-optimal distributed edge coloring
  35. Altmetric Badge
    Chapter 163 The centroid of points with approximate weights
  36. Altmetric Badge
    Chapter 164 0/1-Integer programming: Optimization and Augmentation are equivalent
  37. Altmetric Badge
    Chapter 165 The online transportation problem
  38. Altmetric Badge
    Chapter 166 A polyhedral approach to planar augmentation and related problems
  39. Altmetric Badge
    Chapter 167 Optimal layouts on a chain ATM network
  40. Altmetric Badge
    Chapter 168 Efficient Dynamic-Resharing “Verifiable Secret Sharing” against mobile adversary
  41. Altmetric Badge
    Chapter 169 Adaptive Video on Demand
  42. Altmetric Badge
    Chapter 170 The binomial transform and its application to the analysis of skip lists
  43. Altmetric Badge
    Chapter 171 An optimal parallel algorithm for digital curve segmentation using hough polygons and monotone function search
  44. Altmetric Badge
    Chapter 172 Fast skeleton construction
Attention for Chapter 164: 0/1-Integer programming: Optimization and Augmentation are equivalent
Altmetric Badge

Mentioned by

twitter
3 X users

Citations

dimensions_citation
2 Dimensions

Readers on

mendeley
6 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
0/1-Integer programming: Optimization and Augmentation are equivalent
Chapter number 164
Book title
Algorithms — ESA '95
Published by
Springer, Berlin, Heidelberg, September 1995
DOI 10.1007/3-540-60313-1_164
Book ISBNs
978-3-54-060313-9, 978-3-54-044913-3
Authors

Andreas S. Schulz, Robert Weismantel, Günter M. Ziegler, Schulz, Andreas S., Weismantel, Robert, Ziegler, Günter M.

X Demographics

X Demographics

The data shown below were collected from the profiles of 3 X users who shared this research output. Click here to find out more about how the information was compiled.
Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 6 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 3 50%
Student > Master 2 33%
Researcher 1 17%
Readers by discipline Count As %
Computer Science 4 67%
Engineering 2 33%