Algorithms and Computation

Table of Contents

1. Altmetric Badge
   Book Overview
2. Altmetric Badge
   Chapter 1 Voronoi-Based Systems of Coordinates and Surface Reconstruction
3. Altmetric Badge
   Chapter 2 Essentially Every Unimodular Matrix Defines an Expander
4. Altmetric Badge
   Chapter 3 Strategies for Hotlink Assignments
5. Altmetric Badge
   Chapter 4 A New Competitive Analysis of Randomized Caching
6. Altmetric Badge
   Chapter 5 Online Routing in Convex Subdivisions
7. Altmetric Badge
   Chapter 6 A Simple Linear-Time Approximation Algorithm for Multi-processor Job Scheduling on Four Processors
8. Altmetric Badge
   Chapter 7 Classification of Various Neighborhood Operations for the Nurse Scheduling Problem
9. Altmetric Badge
   Chapter 8 Optimal Bid Sequences for Multiple-Object Auctions with Unequal Budgets
10. Altmetric Badge
    Chapter 9 Coping with Delays and Time-Outs in Binary Search Procedures
11. Altmetric Badge
    Chapter 10 Some Formal Analysis of Rocchio’s Similarity-Based Relevance Feedback Algorithm
12. Altmetric Badge
    Chapter 11 Reasoning with Ordered Binary Decision Diagrams
13. Altmetric Badge
    Chapter 12 On Approximating Minimum Vertex Cover for Graphs with Perfect Matching
14. Altmetric Badge
    Chapter 13 A 2-Approximation Algorithm for Path Coloring on Trees of Rings
15. Altmetric Badge
    Chapter 14 An Approximate Algorithm for the Weighted Hamiltonian Path Completion Problem on a Tree
16. Altmetric Badge
    Chapter 15 Finding Independent Spanning Trees in Partial k -Trees
17. Altmetric Badge
    Chapter 16 On Efficient Fixed Parameter Algorithms for Weighted Vertex Cover
18. Altmetric Badge
    Chapter 17 Constructive Linear Time Algorithms for Small Cutwidth and Carving-Width
19. Altmetric Badge
    Chapter 18 Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial Circuits
20. Altmetric Badge
    Chapter 19 A Simple and Quick Approximation Algorithm for Traveling Salesman Problem in the Plane
21. Altmetric Badge
    Chapter 20 Simple Algorithms for a Weighted Interval Selection Problem
22. Altmetric Badge
    Chapter 21 Efficient Minus and Signed Domination in Graphs
23. Altmetric Badge
    Chapter 22 Convex Grid Drawings of Four-Connected Plane Graphs
24. Altmetric Badge
    Chapter 23 An Algorithm for Finding Three Dimensional Symmetry in Series Parallel Digraphs
25. Altmetric Badge
    Chapter 24 Undecidability Results for Monoids with Linear-Time Decidable Word Problems
26. Altmetric Badge
    Chapter 25 Secret Key Exchange Using Random Deals of Cards on Hierarchical Structures
27. Altmetric Badge
    Chapter 26 Derandomizing Arthur-Merlin Games under Uniform Assumptions
28. Altmetric Badge
    Chapter 27 A Near Optimal Algorithm for Vertex Connectivity Augmentation
29. Altmetric Badge
    Chapter 28 Simultaneous Augmentation of Two Graphs to an ℓ Edge-Connected Graph and a Biconnected Graph
30. Altmetric Badge
    Chapter 29 Location Problems Based on Node-Connectivity and Edge-Connectivity between Nodes and Node-Subsets
31. Altmetric Badge
    Chapter 30 An Intuitive and Effective New Representation for Interconnection Network Structures
32. Altmetric Badge
    Chapter 31 Randomized Leader Election Protocols in Radio Networks with no Collision Detection
33. Altmetric Badge
    Chapter 32 Deterministic Broadcasting Time with Partial Knowledge of the Network
34. Altmetric Badge
    Chapter 33 Minimizing Makespan in Batch Machine Scheduling
35. Altmetric Badge
    Chapter 34 Preemptive Parallel Task Scheduling in O ( n ) + Poly( m ) Time
36. Altmetric Badge
    Chapter 35 Compressed Text Databases with Efficient Query Algorithms Based on the Compressed Suffix Array
37. Altmetric Badge
    Chapter 36 A Better Lower Bound for Two-Circle Point Labeling
38. Altmetric Badge
    Chapter 37 Voronoi Diagram of a Circle Set Constructed from Voronoi Diagram of a Point Set
39. Altmetric Badge
    Chapter 38 An Improved Algorithm for Subdivision Traversal without Extra Storage
40. Altmetric Badge
    Chapter 39 Generalized H -Coloring of Graphs
41. Altmetric Badge
    Chapter 40 Finding a Two-Core of a Tree in Linear Time
42. Altmetric Badge
    Chapter 41 Unbalanced and Hierarchical Bipartite Matchings with Applications to Labeled Tree Comparison
43. Altmetric Badge
    Chapter 42 Optimal Beam Penetrations in Two and Three Dimensions
44. Altmetric Badge
    Chapter 43 Searching a Simple Polygon by a k -Searcher
45. Altmetric Badge
    Chapter 44 Characterization of Rooms Searchable by Two Guards
46. Altmetric Badge
    Chapter 45 Improved Phylogeny Comparisons: Non-shared Edges, Nearest Neighbor Interchanges, and Subtree Transfers
47. Altmetric Badge
    Chapter 46 Phylogenetic k -Root and Steiner k -Root
48. Altmetric Badge
    Chapter 47 Maintenance of a Piercing Set for Intervals with Applications
49. Altmetric Badge
    Chapter 48 Optimal Polygon Cover Problems and Applications