↓ 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 Improving Linear Programming Approaches for the Steiner Tree Problem
  3. Altmetric Badge
    Chapter 2 Algorithms and Experiments on Colouring Squares of Planar Graphs
  4. Altmetric Badge
    Chapter 3 Experimental Analysis of Online Algorithms for the Bicriteria Scheduling Problem
  5. Altmetric Badge
    Chapter 4 Fast-Search : A New Efficient Variant of the Boyer-Moore String Matching Algorithm
  6. Altmetric Badge
    Chapter 5 An On-Line Algorithm for the Rectangle Packing Problem with Rejection
  7. Altmetric Badge
    Chapter 6 New Lower and Upper Bounds for Graph Treewidth
  8. Altmetric Badge
    Chapter 7 Search Data Structures for Skewed Strings
  9. Altmetric Badge
    Chapter 8 Evaluation of Basic Protocols for Optical Smart Dust Networks
  10. Altmetric Badge
    Chapter 9 Linear Time Local Improvements for Weighted Matchings in Graphs
  11. Altmetric Badge
    Chapter 10 Experimental Studies of Graph Traversal Algorithms
  12. Altmetric Badge
    Chapter 11 A Nondifferentiable Optimization Approach to Ratio-Cut Partitioning
  13. Altmetric Badge
    Chapter 12 Comparing Push- and Pull-Based Broadcasting
  14. Altmetric Badge
    Chapter 13 Experimental Comparison of Heuristic and Approximation Algorithms for Uncapacitated Facility Location
  15. Altmetric Badge
    Chapter 14 A Lazy Version of Eppstein’s K Shortest Paths Algorithm
  16. Altmetric Badge
    Chapter 15 Linear Algorithm for 3-Coloring of Locally Connected Graphs
  17. Altmetric Badge
    Chapter 16 A Clustering Algorithm for Interval Graph Test on Noisy Data
  18. Altmetric Badge
    Chapter 17 Core Instances for Testing: A Case Study
  19. Altmetric Badge
    Chapter 18 The Reliable Algorithmic Software Challenge RASC
  20. Altmetric Badge
    Chapter 19 A New Class of Greedy Heuristics for Job Shop Scheduling Problems
  21. Altmetric Badge
    Chapter 20 Algorithmic Techniques for Memory Energy Reduction
  22. Altmetric Badge
    Chapter 21 A Framework for Designing Approximation Algorithms for Scheduling Problems
  23. Altmetric Badge
    Chapter 22 Analysis and Visualization of Social Networks
Attention for Chapter 14: A Lazy Version of Eppstein’s K Shortest Paths Algorithm
Altmetric Badge

Citations

dimensions_citation
6 Dimensions

Readers on

mendeley
21 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.
Chapter title
A Lazy Version of Eppstein’s K Shortest Paths Algorithm
Chapter number 14
Book title
Experimental and Efficient Algorithms
Published by
Springer, Berlin, Heidelberg, May 2003
DOI 10.1007/3-540-44867-5_14
Book ISBNs
978-3-54-040205-3, 978-3-54-044867-9
Authors

Víctor M. Jiménez, Andrés Marzal

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
United Kingdom 1 5%
Spain 1 5%
Germany 1 5%
Austria 1 5%
Unknown 17 81%

Demographic breakdown

Readers by professional status Count As %
Professor > Associate Professor 5 24%
Student > Master 5 24%
Professor 3 14%
Student > Ph. D. Student 3 14%
Researcher 2 10%
Other 3 14%
Readers by discipline Count As %
Computer Science 9 43%
Engineering 5 24%
Business, Management and Accounting 2 10%
Mathematics 2 10%
Agricultural and Biological Sciences 1 5%
Other 0 0%
Unknown 2 10%