↓ Skip to main content

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 Algorithm Engineering for Route Planning – An Update –
  3. Altmetric Badge
    Chapter 2 Semidefinite Programming and Approximation Algorithms: A Survey
  4. Altmetric Badge
    Chapter 3 The School Bus Problem on Trees
  5. Altmetric Badge
    Chapter 4 Improved Approximations for Buy-at-Bulk and Shallow-Light k-Steiner Trees and (k,2)-Subgraph
  6. Altmetric Badge
    Chapter 5 Improved Approximation Algorithms for Routing Shop Scheduling
  7. Altmetric Badge
    Chapter 6 Contraction-Based Steiner Tree Approximations in Practice
  8. Altmetric Badge
    Chapter 7 Covering and Piercing Disks with Two Centers
  9. Altmetric Badge
    Chapter 8 Generating Realistic Roofs over a Rectilinear Polygon
  10. Altmetric Badge
    Chapter 9 Computing the Visibility Polygon Using Few Variables
  11. Altmetric Badge
    Chapter 10 Minimizing Interference in Ad-Hoc Networks with Bounded Communication Radius
  12. Altmetric Badge
    Chapter 11 Hamiltonian Paths in the Square of a Tree
  13. Altmetric Badge
    Chapter 12 Dominating Induced Matchings for P 7-free Graphs in Linear Time
  14. Altmetric Badge
    Chapter 13 Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths
  15. Altmetric Badge
    Chapter 14 Recognizing Polar Planar Graphs Using New Results for Monopolarity
  16. Altmetric Badge
    Chapter 15 Robustness of Minimum Cost Arborescences
  17. Altmetric Badge
    Chapter 16 Path Queries in Weighted Trees
  18. Altmetric Badge
    Chapter 17 Dynamic Range Majority Data Structures
  19. Altmetric Badge
    Chapter 18 Dynamic Range Selection in Linear Space
  20. Altmetric Badge
    Chapter 19 A Dynamic Stabbing-Max Data Structure with Sub-Logarithmic Query Time
  21. Altmetric Badge
    Chapter 20 Encoding 2D Range Maximum Queries
  22. Altmetric Badge
    Chapter 21 Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions
  23. Altmetric Badge
    Chapter 22 Broadcasting in Heterogeneous Tree Networks with Uncertainty
  24. Altmetric Badge
    Chapter 23 Optimal File Distribution in Peer-to-Peer Networks
  25. Altmetric Badge
    Chapter 24 Animal Testing
  26. Altmetric Badge
    Chapter 25 Cutting Out Polygons with a Circular Saw
  27. Altmetric Badge
    Chapter 26 Fast Fréchet Queries
  28. Altmetric Badge
    Chapter 27 Angle-Restricted Steiner Arborescences for Flow Map Layout
  29. Altmetric Badge
    Chapter 28 Treemaps with Bounded Aspect Ratio
  30. Altmetric Badge
    Chapter 29 Simultaneous Embedding of Embedded Planar Graphs
  31. Altmetric Badge
    Chapter 30 Linear-Time Algorithms for Hole-Free Rectilinear Proportional Contact Graph Representations
  32. Altmetric Badge
    Chapter 31 Fully Retroactive Approximate Range and Nearest Neighbor Searching
  33. Altmetric Badge
    Chapter 32 Compact Representation of Posets
  34. Altmetric Badge
    Chapter 33 Explicit Array-Based Compact Data Structures for Triangulations
  35. Altmetric Badge
    Chapter 34 Space-Efficient Data-Analysis Queries on Grids
  36. Altmetric Badge
    Chapter 35 A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments
  37. Altmetric Badge
    Chapter 36 Fixed-Parameter Complexity of Feedback Vertex Set in Bipartite Tournaments
  38. Altmetric Badge
    Chapter 37 Parameterized Algorithms for Inclusion of Linear Matchings
  39. Altmetric Badge
    Chapter 38 Computational Study on Bidimensionality Theory Based Algorithm for Longest Path Problem
  40. Altmetric Badge
    Chapter 39 Sorting, Searching, and Simulation in the MapReduce Framework
  41. Altmetric Badge
    Chapter 40 External-Memory Multimaps
  42. Altmetric Badge
    Chapter 41 External Memory Orthogonal Range Reporting with Fast Updates
  43. Altmetric Badge
    Chapter 42 Analysis of Speedups in Parallel Evolutionary Algorithms for Combinatorial Optimization
  44. Altmetric Badge
    Chapter 43 Verifying Nash Equilibria in PageRank Games on Undirected Web Graphs
  45. Altmetric Badge
    Chapter 44 Improved Collaborative Filtering
  46. Altmetric Badge
    Chapter 45 Asymptotic Modularity of Some Graph Classes
  47. Altmetric Badge
    Chapter 46 Program Size and Temperature in Self-Assembly
  48. Altmetric Badge
    Chapter 47 Optimization, Randomized Approximability, and Boolean Constraint Satisfaction Problems
  49. Altmetric Badge
    Chapter 48 Lower Bounds for Myopic DPLL Algorithms with a Cut Heuristic
  50. Altmetric Badge
    Chapter 49 Algorithm for Single Allocation Problem on Hub-and-Spoke Networks in 2-Dimensional Plane
  51. Altmetric Badge
    Chapter 50 Packing-Based Approximation Algorithm for the k-Set Cover Problem
  52. Altmetric Badge
    Chapter 51 Capacitated Domination: Constant Factor Approximations for Planar Graphs
  53. Altmetric Badge
    Chapter 52 On Power-Law Distributed Balls in Bins and Its Applications to View Size Estimation
  54. Altmetric Badge
    Chapter 53 A Randomized Algorithm for Finding Frequent Elements in Streams Using O(loglogN) Space
  55. Altmetric Badge
    Chapter 54 A Nearly-Quadratic Gap between Adaptive and Non-adaptive Property Testers
  56. Altmetric Badge
    Chapter 55 Online Linear Optimization over Permutations
  57. Altmetric Badge
    Chapter 56 On the Best Possible Competitive Ratio for Multislope Ski Rental
  58. Altmetric Badge
    Chapter 57 Input-Thrifty Extrema Testing
  59. Altmetric Badge
    Chapter 58 Edit Distance to Monotonicity in Sliding Windows
  60. Altmetric Badge
    Chapter 59 Folding Equilateral Plane Graphs
  61. Altmetric Badge
    Chapter 60 Efficient Algorithms for the Weighted k-Center Problem on a Real Line
  62. Altmetric Badge
    Chapter 61 Outlier Respecting Points Approximation
  63. Altmetric Badge
    Chapter 62 An Improved Algorithm for Reconstructing a Simple Polygon from the Visibility Angles
  64. Altmetric Badge
    Chapter 63 The Parameterized Complexity of Local Search for TSP, More Refined
  65. Altmetric Badge
    Chapter 64 On the Parameterized Complexity of Consensus Clustering
  66. Altmetric Badge
    Chapter 65 Two Fixed-Parameter Algorithms for the Cocoloring Problem
  67. Altmetric Badge
    Chapter 66 Algorithms and Computation
  68. Altmetric Badge
    Chapter 67 Faster Approximate Pattern Matching in Compressed Repetitive Texts
  69. Altmetric Badge
    Chapter 68 A New Algorithm for the Characteristic String Problem under Loose Similarity Criteria
  70. Altmetric Badge
    Chapter 69 Succinct Indexes for Circular Patterns
  71. Altmetric Badge
    Chapter 70 Range LCP
  72. Altmetric Badge
    Chapter 71 Computing Knapsack Solutions with Cardinality Robustness
  73. Altmetric Badge
    Chapter 72 Max-Throughput for (Conservative) k-of-n Testing
  74. Altmetric Badge
    Chapter 73 Closest Periodic Vectors in L p Spaces
  75. Altmetric Badge
    Chapter 74 Maximum Weight Digital Regions Decomposable into Digital Star-Shaped Regions
  76. Altmetric Badge
    Chapter 75 Finding Maximum Sum Segments in Sequences with Uncertainty
  77. Altmetric Badge
    Chapter 76 Algorithms for Building Consensus MUL-trees
  78. Altmetric Badge
    Chapter 77 Adaptive Phenotype Testing for AND/OR Items
  79. Altmetric Badge
    Chapter 78 An Index Structure for Spaced Seed Search
Attention for Chapter 71: Computing Knapsack Solutions with Cardinality Robustness
Altmetric Badge

Citations

dimensions_citation
2 Dimensions

Readers on

mendeley
1 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 Knapsack Solutions with Cardinality Robustness
Chapter number 71
Book title
Algorithms and Computation
Published by
Springer, Berlin, Heidelberg, December 2011
DOI 10.1007/978-3-642-25591-5_71
Book ISBNs
978-3-64-225590-8, 978-3-64-225591-5
Authors

Naonori Kakimura, Kazuhisa Makino, Kento Seimi

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 1 100%

Demographic breakdown

Readers by professional status Count As %
Professor 1 100%
Readers by discipline Count As %
Medicine and Dentistry 1 100%