↓ Skip to main content

Experimental and Efficient Algorithms

Overview of attention for book
Cover of 'Experimental and Efficient Algorithms'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 A Hybrid Bin-Packing Heuristic to Multiprocessor Scheduling
  3. Altmetric Badge
    Chapter 2 Efficient Edge-Swapping Heuristics for Finding Minimum Fundamental Cycle Bases
  4. Altmetric Badge
    Chapter 3 Solving Chance-Constrained Programs Combining Tabu Search and Simulation
  5. Altmetric Badge
    Chapter 4 An Algorithm to Identify Clusters of Solutions in Multimodal Optimisation
  6. Altmetric Badge
    Chapter 5 On an Experimental Algorithm for Revenue Management for Cargo Airlines
  7. Altmetric Badge
    Chapter 6 Cooperation between Branch and Bound and Evolutionary Approaches to Solve a Bi-objective Flow Shop Problem
  8. Altmetric Badge
    Chapter 7 Simple Max-Cut for Split-Indifference Graphs and Graphs with Few P 4 ’s
  9. Altmetric Badge
    Chapter 8 A Randomized Heuristic for Scene Recognition by Graph Matching
  10. Altmetric Badge
    Chapter 9 An Efficient Implementation of a Joint Generation Algorithm
  11. Altmetric Badge
    Chapter 10 Lempel, Even, and Cederbaum Planarity Method
  12. Altmetric Badge
    Chapter 11 A Greedy Approximation Algorithm for the Uniform Labeling Problem Analyzed by a Primal-Dual Technique
  13. Altmetric Badge
    Chapter 12 Distributed Circle Formation for Anonymous Oblivious Robots
  14. Altmetric Badge
    Chapter 13 Dynamic Programming and Column Generation Based Approaches for Two-Dimensional Guillotine Cutting Problems
  15. Altmetric Badge
    Chapter 14 Engineering Shortest Path Algorithms
  16. Altmetric Badge
    Chapter 15 How to Tell a Good Neighborhood from a Bad One: Satisfiability of Boolean Formulas
  17. Altmetric Badge
    Chapter 16 Implementing Approximation Algorithms for the Single-Source Unsplittable Flow Problem
  18. Altmetric Badge
    Chapter 17 Fingered Multidimensional Search Trees
  19. Altmetric Badge
    Chapter 18 Faster Deterministic and Randomized Algorithms on the Homogeneous Set Sandwich Problem
  20. Altmetric Badge
    Chapter 19 Efficient Implementation of the BSP/CGM Parallel Vertex Cover FPT Algorithm
  21. Altmetric Badge
    Chapter 20 Combining Speed-Up Techniques for Shortest-Path Computations
  22. Altmetric Badge
    Chapter 21 Increased Bit-Parallelism for Approximate String Matching
  23. Altmetric Badge
    Chapter 22 The Role of Experimental Algorithms in Genomics
  24. Altmetric Badge
    Chapter 23 A Fast Algorithm for Constructing Suffix Arrays for Fixed-Size Alphabets
  25. Altmetric Badge
    Chapter 24 Pre-processing and Linear-Decomposition Algorithm to Solve the k-Colorability Problem
  26. Altmetric Badge
    Chapter 25 An Experimental Study of Unranking Algorithms
  27. Altmetric Badge
    Chapter 26 An Improved Derandomized Approximation Algorithm for the Max-Controlled Set Problem
  28. Altmetric Badge
    Chapter 27 GRASP with Path-Relinking for the Quadratic Assignment Problem
  29. Altmetric Badge
    Chapter 28 Finding Minimum Transmission Radii for Preserving Connectivity and Constructing Minimal Spanning Trees in Ad Hoc and Sensor Networks
  30. Altmetric Badge
    Chapter 29 A Dynamic Algorithm for Topologically Sorting Directed Acyclic Graphs
  31. Altmetric Badge
    Chapter 30 Approximating Interval Coloring and Max-Coloring in Chordal Graphs
  32. Altmetric Badge
    Chapter 31 A Statistical Approach for Algorithm Selection
  33. Altmetric Badge
    Chapter 32 An Improved Time-Sensitive Metaheuristic Framework for Combinatorial Optimization
  34. Altmetric Badge
    Chapter 33 A Huffman-Based Error Detecting Code
  35. Altmetric Badge
    Chapter 34 Solving Diameter Constrained Minimum Spanning Tree Problems in Dense Graphs
  36. Altmetric Badge
    Chapter 35 An Efficient Tabu Search Heuristic for the School Timetabling Problem
  37. Altmetric Badge
    Chapter 36 Experimental Studies of Symbolic Shortest-Path Algorithms
  38. Altmetric Badge
    Chapter 37 Experimental Comparison of Greedy Randomized Adaptive Search Procedures for the Maximum Diversity Problem
  39. Altmetric Badge
    Chapter 38 Using Compact Tries for Cache-Efficient Sorting of Integers
  40. Altmetric Badge
    Chapter 39 Using Random Sampling to Build Approximate Tries for Efficient String Sorting
  41. Altmetric Badge
    Chapter 40 The Datapath Merging Problem in Reconfigurable Systems: Lower Bounds and Heuristic Evaluation
  42. Altmetric Badge
    Chapter 41 An Analytical Model for Energy Minimization
  43. Altmetric Badge
    Chapter 42 A Heuristic for Minimum-Width Graph Layering with Consideration of Dummy Nodes
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

patent
1 patent
facebook
1 Facebook page
wikipedia
1 Wikipedia page

Citations

dimensions_citation
2 Dimensions

Readers on

mendeley
9 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
Experimental and Efficient Algorithms
Published by
Springer Science & Business Media, May 2004
DOI 10.1007/b97914
ISBNs
978-3-54-022067-1, 978-3-54-024838-5
Editors

Ribeiro, Celso C., Martins, Simone L.

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 9 100%

Demographic breakdown

Readers by professional status Count As %
Unknown 9 100%
Readers by discipline Count As %
Unknown 9 100%