↓ Skip to main content

Algorithms and Complexity

Overview of attention for book
Cover of 'Algorithms and Complexity'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 On Salesmen, Repairmen, Spiders, and Other Traveling Agents
  3. Altmetric Badge
    Chapter 2 Computing a Diameter-Constrained Minimum Spanning Tree in Parallel
  4. Altmetric Badge
    Chapter 3 Algorithms for a Simple Point Placement Problem
  5. Altmetric Badge
    Chapter 4 Duality in ATM Layout Problems
  6. Altmetric Badge
    Chapter 5 The Independence Number of Random Interval Graphs
  7. Altmetric Badge
    Chapter 6 Online Strategies for Backups
  8. Altmetric Badge
    Chapter 7 Towards the Notion of Stability of Approximation for Hard Optimization Tasks and the Traveling Salesman Problem
  9. Altmetric Badge
    Chapter 8 Semantical Counting Circuits
  10. Altmetric Badge
    Chapter 9 The Hardness of Placing Street Names in a Manhattan Type Map
  11. Altmetric Badge
    Chapter 10 Labeling Downtown
  12. Altmetric Badge
    Chapter 11 The Online Dial-a-Ride Problem under Reasonable Load
  13. Altmetric Badge
    Chapter 12 The Online-TSP against Fair Adversaries
  14. Altmetric Badge
    Chapter 13 QuickHeapsort, an Efficient Mix of Classical Sorting Algorithms
  15. Altmetric Badge
    Chapter 14 Triangulations without Minimum-Weight Drawing
  16. Altmetric Badge
    Chapter 15 Faster Exact Solutions for M ax 2S at
  17. Altmetric Badge
    Chapter 16 Dynamically Maintaining the Widest k -Dense Corridor
  18. Altmetric Badge
    Chapter 17 Reconstruction of Discrete Sets from Three or More X-Rays
  19. Altmetric Badge
    Chapter 18 Modified Binary Searching for Static Tables
  20. Altmetric Badge
    Chapter 19 An Efficient Algorithm for the Approximate Median Selection Problem
  21. Altmetric Badge
    Chapter 20 Extending the Implicit Computational Complexity Approach to the Sub-elementary Time-Space Classes
  22. Altmetric Badge
    Chapter 21 Group Updates for Bed-Black Trees
  23. Altmetric Badge
    Chapter 22 Approximating SVP ∞ to within Almost-Polynomial Factors Is NP-Hard
  24. Altmetric Badge
    Chapter 23 Convergence Analysis of Simulated Annealing-Based Algorithms Solving Flow Shop Scheduling Problems
  25. Altmetric Badge
    Chapter 24 On the Lovász Number of Certain Circulant Graphs
  26. Altmetric Badge
    Chapter 25 Speeding Up Pattern Matching by Text Compression
Attention for Chapter 2: Computing a Diameter-Constrained Minimum Spanning Tree in Parallel
Altmetric Badge

Readers on

12 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
Computing a Diameter-Constrained Minimum Spanning Tree in Parallel
Chapter number 2
Book title
Algorithms and Complexity
Published by
Springer, Berlin, Heidelberg, March 2000
DOI 10.1007/3-540-46521-9_2
Book ISBNs
978-3-54-067159-6, 978-3-54-046521-8

Narsingh Deo, Ayman Abdalla

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Germany 1 8%
Austria 1 8%
Unknown 10 83%

Demographic breakdown

Readers by professional status Count As %
Researcher 3 25%
Professor > Associate Professor 2 17%
Student > Ph. D. Student 2 17%
Librarian 1 8%
Lecturer 1 8%
Other 2 17%
Unknown 1 8%
Readers by discipline Count As %
Computer Science 4 33%
Business, Management and Accounting 3 25%
Mathematics 1 8%
Agricultural and Biological Sciences 1 8%
Social Sciences 1 8%
Other 0 0%
Unknown 2 17%