↓ Skip to main content
What is this page? Embed badge

Experimental Algorithms

Overview of attention for book
Cover of 'Experimental Algorithms'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Automatic Decomposition and Branch-and-Price—A Status Report
  3. Altmetric Badge
    Chapter 2 Continuous Local Strategies for Robotic Formation Problems
  4. Altmetric Badge
    Chapter 3 Engineering Graph Partitioning Algorithms
  5. Altmetric Badge
    Chapter 4 Space Efficient Modifications to Structator— A Fast Index-Based Search Tool for RNA Sequence-Structure Patterns
  6. Altmetric Badge
    Chapter 5 Implementation and Comparison of Heuristics for the Vertex Cover Problem on Huge Graphs
  7. Altmetric Badge
    Chapter 6 How to Attack the NP-Complete Dag Realization Problem in Practice
  8. Altmetric Badge
    Chapter 7 New Results about Multi-band Uncertainty in Robust Optimization
  9. Altmetric Badge
    Chapter 8 Compact Relaxations for Polynomial Programming Problems
  10. Altmetric Badge
    Chapter 9 Relaxations of Multilinear Convex Envelopes: Dual Is Better Than Primal
  11. Altmetric Badge
    Chapter 10 On Computing the Diameter of Real-World Directed (Weighted) Graphs
  12. Altmetric Badge
    Chapter 11 Reoptimizing the Strengthened Metric TSP on Multiple Edge Weight Modifications
  13. Altmetric Badge
    Chapter 12 Engineering a New Loop-Free Shortest Paths Routing Algorithm
  14. Altmetric Badge
    Chapter 13 Fully Dynamic Maintenance of Arc-Flags in Road Networks
  15. Altmetric Badge
    Chapter 14 A More Reliable Greedy Heuristic for Maximum Matchings in Sparse Random Graphs
  16. Altmetric Badge
    Chapter 15 Branch Mispredictions Don’t Affect Mergesort
  17. Altmetric Badge
    Chapter 16 A Multiple Sliding Windows Approach to Speed Up String Matching Algorithms
  18. Altmetric Badge
    Chapter 17 Algorithms for Subnetwork Mining in Heterogeneous Networks
  19. Altmetric Badge
    Chapter 18 Computing Strong Articulation Points and Strong Bridges in Large Scale Graphs
  20. Altmetric Badge
    Chapter 19 Adaptive Distributed b-Matching in Overlays with Preferences
  21. Altmetric Badge
    Chapter 20 Dynamizing Succinct Tree Representations
  22. Altmetric Badge
    Chapter 21 A Label Correcting Algorithm for the Shortest Path Problem on a Multi-modal Route Network
  23. Altmetric Badge
    Chapter 22 Efficient Enumeration of the Directed Binary Perfect Phylogenies from Incomplete Data
  24. Altmetric Badge
    Chapter 23 Candidate Sets for Alternative Routes in Road Networks
  25. Altmetric Badge
    Chapter 24 Paired and Altruistic Kidney Donation in the UK: Algorithms and Experimentation
  26. Altmetric Badge
    Chapter 25 An Evaluation of Community Detection Algorithms on Large-Scale Email Traffic
  27. Altmetric Badge
    Chapter 26 Fast, Small, Simple Rank/Select on Bitmaps
  28. Altmetric Badge
    Chapter 27 Space-Efficient Top-k Document Retrieval
  29. Altmetric Badge
    Chapter 28 Engineering Efficient Paging Algorithms
  30. Altmetric Badge
    Chapter 29 Feasibility Pump Heuristics for Column Generation Approaches
  31. Altmetric Badge
    Chapter 30 Exact Graph Search Algorithms for Generalized Traveling Salesman Path Problems
  32. Altmetric Badge
    Chapter 31 Control Complexity in Bucklin, Fallback, and Plurality Voting: An Experimental Approach
  33. Altmetric Badge
    Chapter 32 Advanced Coarsening Schemes for Graph Partitioning
  34. Altmetric Badge
    Chapter 33 A Heuristic for Non-convex Variance-Based Clustering Criteria
  35. Altmetric Badge
    Chapter 34 A Decomposition Approach for Solving Critical Clique Detection Problems
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
2 X users
wikipedia
1 Wikipedia page
q&a
1 Q&A thread

Citations

dimensions_citation
3 Dimensions

Readers on

mendeley
2 Mendeley
Summary X Wikipedia Q&A Dimensions citations
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 Algorithms
Published by
Springer Berlin Heidelberg, January 2012
DOI 10.1007/978-3-642-30850-5
ISBNs
978-3-64-230849-9, 978-3-64-230850-5
Authors

Klasing, Ralf

Editors

Ralf Klasing

View on publisher site
X Demographics

X Demographics

The data shown below were collected from the profiles of 2 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 2 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 2 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 1 50%
Student > Master 1 50%
Readers by discipline Count As %
Mathematics 1 50%
Engineering 1 50%

This page is provided by Altmetric.