Experimental Algorithms

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Experimental Study of Resilient Algorithms and Data Structures
3. Altmetric Badge
   Chapter 2 Computational Challenges with Cliques, Quasi-cliques and Clique Partitions in Graphs
4. Altmetric Badge
   Chapter 3 Alternative Routes in Road Networks
5. Altmetric Badge
   Chapter 4 Fully Dynamic Speed-Up Techniques for Multi-criteria Shortest Path Searches in Time-Dependent Networks
6. Altmetric Badge
   Chapter 5 Space-Efficient SHARC-Routing
7. Altmetric Badge
   Chapter 6 A New Fully Dynamic Algorithm for Distributed Shortest Paths and Its Experimental Evaluation
8. Altmetric Badge
   Chapter 7 Contraction of Timetable Networks with Realistic Transfers
9. Altmetric Badge
   Chapter 8 Distributed Time-Dependent Contraction Hierarchies
10. Altmetric Badge
    Chapter 9 Practical Compressed Suffix Trees
11. Altmetric Badge
    Chapter 10 Maximum Cliques in Protein Structure Comparison
12. Altmetric Badge
    Chapter 11 Exact Bipartite Crossing Minimization under Tree Constraints
13. Altmetric Badge
    Chapter 12 Bit-Parallel Search Algorithms for Long Patterns
14. Altmetric Badge
    Chapter 13 Fast FPT Algorithms for Computing Rooted Agreement Forests: Theory and Experiments
15. Altmetric Badge
    Chapter 14 Experimental Evaluation of Approximation and Heuristic Algorithms for Sorting Railway Cars
16. Altmetric Badge
    Chapter 15 Time-Dependent Contraction Hierarchies and Approximation
17. Altmetric Badge
    Chapter 16 A New Combinational Logic Minimization Technique with Applications to Cryptology
18. Altmetric Badge
    Chapter 17 Randomized Rounding for Routing and Covering Problems: Experiments and Improvements
19. Altmetric Badge
    Chapter 18 The Time Dependent Traveling Salesman Problem: Polyhedra and Branch-Cut-and-Price Algorithm
20. Altmetric Badge
    Chapter 19 An Approximate ε -Constraint Method for the Multi-objective Undirected Capacitated Arc Routing Problem
21. Altmetric Badge
    Chapter 20 A Branch-and-Price Algorithm for Multi-mode Resource Leveling
22. Altmetric Badge
    Chapter 21 Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs
23. Altmetric Badge
    Chapter 22 Using Bound Sets in Multiobjective Optimization: Application to the Biobjective Binary Knapsack Problem
24. Altmetric Badge
    Chapter 23 Improving Cutting Plane Generation with 0-1 Inequalities by Bi-criteria Separation
25. Altmetric Badge
    Chapter 24 New Lower Bounds for the Vehicle Routing Problem with Simultaneous Pickup and Delivery
26. Altmetric Badge
    Chapter 25 A Metaheuristic for a Two Echelon Location-Routing Problem
27. Altmetric Badge
    Chapter 26 New Fast Heuristics for the 2D Strip Packing Problem with Guillotine Constraint
28. Altmetric Badge
    Chapter 27 An Experimental Comparison of Different Heuristics for the Master Bay Plan Problem
29. Altmetric Badge
    Chapter 28 An Analysis of Heuristics for Vertex Colouring
30. Altmetric Badge
    Chapter 29 Automatic Tuning of GRASP with Path-Relinking Heuristics with a Biased Random-Key Genetic Algorithm
31. Altmetric Badge
    Chapter 30 Experiments with a Feasibility Pump Approach for Nonconvex MINLPs
32. Altmetric Badge
    Chapter 31 Paging Multiple Users in Cellular Network: Yellow Page and Conference Call Problems
33. Altmetric Badge
    Chapter 32 Realtime Classification for Encrypted Traffic
34. Altmetric Badge
    Chapter 33 Data Propagation with Guaranteed Delivery for Mobile Networks
35. Altmetric Badge
    Chapter 34 Data Structures Resilient to Memory Faults: An Experimental Study of Dictionaries
36. Altmetric Badge
    Chapter 35 Experiments on Union-Find Algorithms for the Disjoint-Set Data Structure
37. Altmetric Badge
    Chapter 36 Policy-Based Benchmarking of Weak Heaps and Their Relatives,
38. Altmetric Badge
    Chapter 37 Modularity-Driven Clustering of Dynamic Graphs
39. Altmetric Badge
    Chapter 38 Gateway Decompositions for Constrained Reachability Problems
40. Altmetric Badge
    Chapter 39 Robust and Efficient Delaunay Triangulations of Points on Or Close to a Sphere
41. Altmetric Badge
    Chapter 40 Fault Recovery in Wireless Networks: The Geometric Recolouring Approach
42. Altmetric Badge
    Chapter 41 Geometric Minimum Spanning Trees with GeoFilterKruskal
43. Altmetric Badge
    Chapter 42 Practical Nearest Neighbor Search in the Plane