↓ Skip to main content

Algorithms – ESA 2011

Overview of attention for book
Cover of 'Algorithms – ESA 2011'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Polynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility under Budget Constraints
  3. Altmetric Badge
    Chapter 2 Approximating the Smallest 2-Vertex Connected Spanning Subgraph of a Directed Graph
  4. Altmetric Badge
    Chapter 3 Improved Approximation Algorithms for Bipartite Correlation Clustering
  5. Altmetric Badge
    Chapter 4 Bounds on Greedy Algorithms for MAX SAT
  6. Altmetric Badge
    Chapter 5 Approximating Minimum Manhattan Networks in Higher Dimensions
  7. Altmetric Badge
    Chapter 6 On Isolating Points Using Disks
  8. Altmetric Badge
    Chapter 7 An Output-Sensitive Approach for the L 1 / L  ∞  k -Nearest-Neighbor Voronoi Diagram
  9. Altmetric Badge
    Chapter 8 Can Nearest Neighbor Searching Be Simple and Always Fast?
  10. Altmetric Badge
    Chapter 9 Algorithms – ESA 2011
  11. Altmetric Badge
    Chapter 10 How Profitable Are Strategic Behaviors in a Market?
  12. Altmetric Badge
    Chapter 11 Algorithms – ESA 2011
  13. Altmetric Badge
    Chapter 12 Algorithms for Finding a Maximum Non- k -linked Graph
  14. Altmetric Badge
    Chapter 13 An $\mathcal{O}(n^4)$ Time Algorithm to Compute the Bisection Width of Solid Grid Graphs
  15. Altmetric Badge
    Chapter 14 Min-Cuts and Shortest Cycles in Planar Graphs in O ( n loglog n ) Time
  16. Altmetric Badge
    Chapter 15 Near-Popular Matchings in the Roommates Problem
  17. Altmetric Badge
    Chapter 16 The Hospitals/Residents Problem with Quota Lower Bounds
  18. Altmetric Badge
    Chapter 17 Multi-parameter Mechanism Design under Budget and Matroid Constraints
  19. Altmetric Badge
    Chapter 18 Quantified Linear Programs: A Computational Study
  20. Altmetric Badge
    Chapter 19 Recoverable Robustness by Column Generation
  21. Altmetric Badge
    Chapter 20 Passenger Flow-Oriented Train Disposition
  22. Altmetric Badge
    Chapter 21 One to Rule Them All: A General Randomized Algorithm for Buffer Management with Bounded Delay
  23. Altmetric Badge
    Chapter 22 Better Bounds for Incremental Frequency Allocation in Bipartite Graphs
  24. Altmetric Badge
    Chapter 23 Two-Bounded-Space Bin Packing Revisited
  25. Altmetric Badge
    Chapter 24 Output-Sensitive Listing of Bounded-Size Trees in Undirected Graphs
  26. Altmetric Badge
    Chapter 25 Exact Algorithm for the Maximum Induced Planar Subgraph Problem
  27. Altmetric Badge
    Chapter 26 Scheduling Partially Ordered Jobs Faster Than 2 n
  28. Altmetric Badge
    Chapter 27 AdCell: Ad Allocation in Cellular Networks
  29. Altmetric Badge
    Chapter 28 Submodular Max-SAT
  30. Altmetric Badge
    Chapter 29 On Variants of the Matroid Secretary Problem
  31. Altmetric Badge
    Chapter 30 Hitting Sets Online and Vertex Ranking
  32. Altmetric Badge
    Chapter 31 Fast Sub-exponential Algorithms and Compactness in Planar Graphs
  33. Altmetric Badge
    Chapter 32 Isomorphism of (mis)Labeled Graphs
  34. Altmetric Badge
    Chapter 33 Paths, Flowers and Vertex Cover
  35. Altmetric Badge
    Chapter 34 Hitting and Harvesting Pumpkins
  36. Altmetric Badge
    Chapter 35 Deterministic Discrepancy Minimization
  37. Altmetric Badge
    Chapter 36 Pattern Matching in Lempel-Ziv Compressed Strings: Fast, Simple, and Deterministic
  38. Altmetric Badge
    Chapter 37 An Experimental Study on Approximating K Shortest Simple Paths
  39. Altmetric Badge
    Chapter 38 Scope-Based Route Planning
  40. Altmetric Badge
    Chapter 39 Maximum Flows by Incremental Breadth-First Search
  41. Altmetric Badge
    Chapter 40 Engineering Multilevel Graph Partitioning Algorithms
  42. Altmetric Badge
    Chapter 41 A Nearly Optimal Algorithm for Finding L 1 Shortest Paths among Polygonal Obstacles in the Plane
  43. Altmetric Badge
    Chapter 42 Motion Planning via Manifold Samples
  44. Altmetric Badge
    Chapter 43 Ray-Shooting Depth: Computing Statistical Data Depth of Point Sets in the Plane
  45. Altmetric Badge
    Chapter 44 Improved Algorithms for Partial Curve Matching
  46. Altmetric Badge
    Chapter 45 On the Configuration-LP for Scheduling on Unrelated Machines
  47. Altmetric Badge
    Chapter 46 Resource Allocation for Covering Time Varying Demands
  48. Altmetric Badge
    Chapter 47 Mixed-Criticality Scheduling of Sporadic Task Systems
  49. Altmetric Badge
    Chapter 48 Robust Algorithms for Preemptive Scheduling
  50. Altmetric Badge
    Chapter 49 Approximate Distance Queries for Weighted Polyhedral Surfaces
  51. Altmetric Badge
    Chapter 50 The Union of Probabilistic Boxes: Maintaining the Volume
  52. Altmetric Badge
    Chapter 51 Preprocess, Set, Query!
  53. Altmetric Badge
    Chapter 52 Cuckoo Hashing with Pages
  54. Altmetric Badge
    Chapter 53 Approximation Algorithms and Hardness Results for the Joint Replenishment Problem with Constant Demands
  55. Altmetric Badge
    Chapter 54 Approximation Algorithms for Conflict-Free Vehicle Routing
  56. Altmetric Badge
    Chapter 55 A $\frac{3}{2}$ Approximation for a Constrained Forest Problem
  57. Altmetric Badge
    Chapter 56 External-Memory Network Analysis Algorithms for Naturally Sparse Graphs
  58. Altmetric Badge
    Chapter 57 Approximate Counting of Cycles in Streams
  59. Altmetric Badge
    Chapter 58 Algorithms for Solving Rubik’s Cubes
  60. Altmetric Badge
    Chapter 59 Boundary Patrolling by Mobile Agents with Distinct Maximal Speeds
  61. Altmetric Badge
    Chapter 60 Optimal Discovery Strategies in White Space Networks
  62. Altmetric Badge
    Chapter 61 Social-Aware Forwarding Improves Routing Performance in Pocket Switched Networks
  63. Altmetric Badge
    Chapter 62 Tolerant Algorithms
  64. Altmetric Badge
    Chapter 63 Alphabet-Independent Compressed Text Indexing
  65. Altmetric Badge
    Chapter 64 Distribution-Aware Compressed Full-Text Indexes
  66. Altmetric Badge
    Chapter 65 Smoothed Performance Guarantees for Local Search
  67. Altmetric Badge
    Chapter 66 Improved Approximations for k -Exchange Systems
  68. Altmetric Badge
    Chapter 67 Algorithms – ESA 2011
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

news
1 news outlet
patent
1 patent
wikipedia
10 Wikipedia pages

Readers on

mendeley
1 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
Algorithms – ESA 2011
Published by
Springer, Berlin, Heidelberg, January 2011
DOI 10.1007/978-3-642-23719-5
ISBNs
978-3-64-223718-8, 978-3-64-223719-5
Editors

Camil Demetrescu, Magnús M. Halldórsson

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 1 100%

Demographic breakdown

Readers by professional status Count As %
Student > Bachelor 1 100%
Readers by discipline Count As %
Computer Science 1 100%