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

Algorithms and Computation

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

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 The Engineering of Some Bipartite Matching Programs
  3. Altmetric Badge
    Chapter 2 General Splay: A Basic Theory and Calculus
  4. Altmetric Badge
    Chapter 3 Static Dictionaries Supporting Rank
  5. Altmetric Badge
    Chapter 4 Multiple Spin-Block Decisions
  6. Altmetric Badge
    Chapter 5 Asynchronous Random Polling Dynamic Load Balancing
  7. Altmetric Badge
    Chapter 6 Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colarability
  8. Altmetric Badge
    Chapter 7 Hardness of Approximating Independent Domination in Circle Graphs
  9. Altmetric Badge
    Chapter 8 Constant-Factor Approximation Algorithms for Domination Problems on Circle Graphs
  10. Altmetric Badge
    Chapter 9 Ordered Binary Decision Diagrams as Knowledge-Bases
  11. Altmetric Badge
    Chapter 10 Hard Tasks for Weak Robots: The Role of Common Knowledge in Pattern Formation by Autonomous Mobile Robots
  12. Altmetric Badge
    Chapter 11 On-Line Load Balancing of Temporary Tasks Revisited
  13. Altmetric Badge
    Chapter 12 Online Routing in Triangulations
  14. Altmetric Badge
    Chapter 13 The Query Complexity of Program Checking by Constant-Depth Circuits
  15. Altmetric Badge
    Chapter 14 Tree-Like Resolution Is Superpolynomially Slower Than DAG-Like Resolution for the Pigeonhole Principle
  16. Altmetric Badge
    Chapter 15 Efficient Approximation Algorithms for Multi-label Map Labeling
  17. Altmetric Badge
    Chapter 16 Approximation Algorithms in Batch Processing
  18. Altmetric Badge
    Chapter 17 LexBFS-Ordering in Asteroidal Triple-Free Graphs
  19. Altmetric Badge
    Chapter 18 Parallel Algorithms for Shortest Paths and Related Problems on Trapezoid Graphs
  20. Altmetric Badge
    Chapter 19 Approximation Algorithms for Some Clustering and Classification Problems
  21. Altmetric Badge
    Chapter 20 How Many People Can Hide in a Terrain?
  22. Altmetric Badge
    Chapter 21 Carrying Umbrellas: An Online Relocation Problem on Graphs
  23. Altmetric Badge
    Chapter 22 Survivable Networks with Bounded Delay: The Edge Failure Case
  24. Altmetric Badge
    Chapter 23 Energy-Efficient Initialization Protocols for Ad-hoc Radio Networks
  25. Altmetric Badge
    Chapter 24 Constructing the Suffix Tree of a Tree with a Large Alphabet
  26. Altmetric Badge
    Chapter 25 An O (1) Time Algorithm for Generating Multiset Permutations
  27. Altmetric Badge
    Chapter 26 Upper Bounds for MaxSat: Further Improved
  28. Altmetric Badge
    Chapter 27 A Linear Time Algorithm for Recognizing Regular Boolean Functions
  29. Altmetric Badge
    Chapter 28 Station Layouts in the Presence of Location Constraints
  30. Altmetric Badge
    Chapter 29 Reverse Center Location Problem
  31. Altmetric Badge
    Chapter 30 Performance Comparison of Linear Sieve and Cubic Sieve Algorithms for Discrete Logarithms over Prime Fields
  32. Altmetric Badge
    Chapter 31 External Memory Algorithms for Outerplanar Graphs
  33. Altmetric Badge
    Chapter 32 A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree
  34. Altmetric Badge
    Chapter 33 Approximation Algorithms for Channel Assignment with Constraints
  35. Altmetric Badge
    Chapter 34 Algorithms for Finding Noncrossing Steiner Forests in Plane Graphs
  36. Altmetric Badge
    Chapter 35 A Linear Algorithm for Finding Total Colorings of Partial k-Trees
  37. Altmetric Badge
    Chapter 36 Topology-Oriented Approach to Robust Geometric Computation
  38. Altmetric Badge
    Chapter 37 Approximating Multicast Congestion
  39. Altmetric Badge
    Chapter 38 Approximating the Minimum k -way Cut in a Graph via Minimum 3-way Cuts
  40. Altmetric Badge
    Chapter 39 Online Scheduling of Parallel Communications with Individual Deadlines
  41. Altmetric Badge
    Chapter 40 A Faster Algorithm for Finding Disjoint Paths in Grids
  42. Altmetric Badge
    Chapter 41 Output-Sensitive Algorithms for Uniform Partitions of Points
  43. Altmetric Badge
    Chapter 42 Convexifying Monotone Polygons
  44. Altmetric Badge
    Chapter 43 Bisecting Two Subsets in 3-Connected Graphs
  45. Altmetric Badge
    Chapter 44 Generalized Maximum Independent Sets for Trees in Subquadratic Time
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

blogs
1 blog
twitter
1 X user

Citations

dimensions_citation
1 Dimensions
Summary Blogs X 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
Algorithms and Computation
Published by
Springer Berlin Heidelberg, June 2003
DOI 10.1007/3-540-46632-0
ISBNs
978-3-54-066916-6, 978-3-54-046632-1
Authors

Aggarwal, Alok, Rangan, C. Pandu

View on publisher site
X Demographics

X Demographics

The data shown below were collected from the profile of 1 X user who shared this research output. Click here to find out more about how the information was compiled.

This page is provided by Altmetric.