↓ 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 Tα Π αι δí α Π α í ζε ι The Interaction Between Algorithms and Game Theory
  3. Altmetric Badge
    Chapter 2 Using an Adaptive Memory Strategy to Improve a Multistart Heuristic for Sequencing by Hybridization
  4. Altmetric Badge
    Chapter 3 High-Performance Algorithm Engineering for Large-Scale Graph Problems and Computational Biology
  5. Altmetric Badge
    Chapter 4 The “Real” Approximation Factor of the MST Heuristic for the Minimum Energy Broadcasting
  6. Altmetric Badge
    Chapter 5 Implementing Minimum Cycle Basis Algorithms
  7. Altmetric Badge
    Chapter 6 Rounding to an Integral Program
  8. Altmetric Badge
    Chapter 7 Rectangle Covers Revisited Computationally
  9. Altmetric Badge
    Chapter 8 Experimental and Efficient Algorithms
  10. Altmetric Badge
    Chapter 9 Experimental Results for Stackelberg Scheduling Strategies
  11. Altmetric Badge
    Chapter 10 An Improved Branch-and-Bound Algorithm for the Test Cover Problem
  12. Altmetric Badge
    Chapter 11 Degree-Based Treewidth Lower Bounds
  13. Altmetric Badge
    Chapter 12 Inferring AS Relationships: Dead End or Lively Beginning?
  14. Altmetric Badge
    Chapter 13 Acceleration of Shortest Path and Constrained Shortest Path Computation
  15. Altmetric Badge
    Chapter 14 A General Buffer Scheme for the Windows Scheduling Problem
  16. Altmetric Badge
    Chapter 15 Implementation of Approximation Algorithms for the Multicast Congestion Problem
  17. Altmetric Badge
    Chapter 16 Frequency Assignment and Multicoloring Powers of Square and Triangular Meshes
  18. Altmetric Badge
    Chapter 17 From Static Code Distribution to More Shrinkage for the Multiterminal Cut
  19. Altmetric Badge
    Chapter 18 Partitioning Graphs to Speed Up Dijkstra’s Algorithm
  20. Altmetric Badge
    Chapter 19 Efficient Convergence to Pure Nash Equilibria in Weighted Network Congestion Games
  21. Altmetric Badge
    Chapter 20 New Upper Bound Heuristics for Treewidth
  22. Altmetric Badge
    Chapter 21 Accelerating Vickrey Payment Computation in Combinatorial Auctions for an Airline Alliance
  23. Altmetric Badge
    Chapter 22 Algorithm Engineering for Optimal Graph Bipartization
  24. Altmetric Badge
    Chapter 23 Empirical Analysis of the Connectivity Threshold of Mobile Agents on the Grid
  25. Altmetric Badge
    Chapter 24 Multiple-Winners Randomized Tournaments with Consensus for Optimization Problems in Generic Metric Spaces
  26. Altmetric Badge
    Chapter 25 On Symbolic Scheduling Independent Tasks with Restricted Execution Times
  27. Altmetric Badge
    Chapter 26 A Simple Randomized k -Local Election Algorithm for Local Computations
  28. Altmetric Badge
    Chapter 27 Generating and Radiocoloring Families of Perfect Graphs
  29. Altmetric Badge
    Chapter 28 Efficient Implementation of Rank and Select Functions for Succinct Representation
  30. Altmetric Badge
    Chapter 29 Comparative Experiments with GRASP and Constraint Programming for the Oil Well Drilling Problem
  31. Altmetric Badge
    Chapter 30 A Framework for Probabilistic Numerical Evaluation of Sensor Networks: A Case Study of a Localization Protocol
  32. Altmetric Badge
    Chapter 31 A Cut-Based Heuristic to Produce Almost Feasible Periodic Railway Timetables
  33. Altmetric Badge
    Chapter 32 GRASP with Path-Relinking for the Weighted Maximum Satisfiability Problem
  34. Altmetric Badge
    Chapter 33 New Bit-Parallel Indel-Distance Algorithm
  35. Altmetric Badge
    Chapter 34 Dynamic Application Placement Under Service and Memory Constraints
  36. Altmetric Badge
    Chapter 35 Integrating Coordinated Checkpointing and Recovery Mechanisms into DSM Synchronization Barriers
  37. Altmetric Badge
    Chapter 36 Synchronization Fault Cryptanalysis for Breaking A5/1
  38. Altmetric Badge
    Chapter 37 An Efficient Algorithm for δ -Approximate Matching with α -Bounded Gaps in Musical Sequences
  39. Altmetric Badge
    Chapter 38 The Necessity of Timekeeping in Adversarial Queueing
  40. Altmetric Badge
    Chapter 39 BDDs in a Branch and Cut Framework
  41. Altmetric Badge
    Chapter 40 Parallel Smith-Waterman Algorithm for Local DNA Comparison in a Cluster of Workstations
  42. Altmetric Badge
    Chapter 41 Fast Algorithms for Weighted Bipartite Matching
  43. Altmetric Badge
    Chapter 42 A Practical Minimal Perfect Hashing Method
  44. Altmetric Badge
    Chapter 43 Efficient and Experimental Meta-heuristics for MAX-SAT Problems
  45. Altmetric Badge
    Chapter 44 Experimental Evaluation of the Greedy and Random Algorithms for Finding Independent Sets in Random Graphs
  46. Altmetric Badge
    Chapter 45 Local Clustering of Large Graphs by Approximate Fiedler Vectors
  47. Altmetric Badge
    Chapter 46 Almost FPRAS for Lattice Models of Protein Folding
  48. Altmetric Badge
    Chapter 47 Vertex Cover Approximations: Experiments and Observations
  49. Altmetric Badge
    Chapter 48 GRASP with Path-Relinking for the Maximum Diversity Problem
  50. Altmetric Badge
    Chapter 49 How to Splay for loglog N -Competitiveness
  51. Altmetric Badge
    Chapter 50 Distilling Router Data Analysis for Faster and Simpler Dynamic IP Lookup Algorithms
  52. Altmetric Badge
    Chapter 51 Optimal Competitive Online Ray Search with an Error-Prone Robot
  53. Altmetric Badge
    Chapter 52 An Empirical Study for Inversions-Sensitive Sorting Algorithms
  54. Altmetric Badge
    Chapter 53 Approximation Algorithm for Chromatic Index and Edge-Coloring of Multigraphs
  55. Altmetric Badge
    Chapter 54 Finding, Counting and Listing All Triangles in Large Graphs, an Experimental Study
  56. Altmetric Badge
    Chapter 55 Selecting the Roots of a Small System of Polynomial Equations by Tolerance Based Matching
  57. Altmetric Badge
    Chapter 56 Developing Novel Statistical Bandwidths for Communication Networks with Incomplete Information
  58. Altmetric Badge
    Chapter 57 Dynamic Quality of Service Support in Virtual Private Networks
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
2 X users
wikipedia
4 Wikipedia pages

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
47 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, April 2005
DOI 10.1007/b136461
ISBNs
978-3-54-025920-6, 978-3-54-032078-4
Editors

Nikoletseas, Sotiris E.

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 47 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Portugal 1 2%
Switzerland 1 2%
France 1 2%
Slovakia 1 2%
Canada 1 2%
Korea, Republic of 1 2%
Japan 1 2%
Unknown 40 85%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 12 26%
Student > Master 9 19%
Student > Doctoral Student 6 13%
Student > Bachelor 5 11%
Professor 4 9%
Other 7 15%
Unknown 4 9%
Readers by discipline Count As %
Computer Science 18 38%
Engineering 11 23%
Mathematics 5 11%
Business, Management and Accounting 2 4%
Agricultural and Biological Sciences 2 4%
Other 4 9%
Unknown 5 11%