↓ 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 Localized Network Representations
  3. Altmetric Badge
    Chapter 2 Optimal Binary Search Trees with Costs Depending on the Access Paths
  4. Altmetric Badge
    Chapter 3 On the Generation of Extensions of a Partially Ordered Set
  5. Altmetric Badge
    Chapter 4 Error-Correcting Codes in Complexity Theory
  6. Altmetric Badge
    Chapter 5 Cache-Oblivious Algorithms
  7. Altmetric Badge
    Chapter 6 Spanning Trees with Low Maximum/Average Stretch
  8. Altmetric Badge
    Chapter 7 Hyper Encryption and Everlasting Secrets
  9. Altmetric Badge
    Chapter 8 Computing with Electronic Nanotechnologies
  10. Altmetric Badge
    Chapter 9 Efficient Update Strategies for Geometric Computing with Uncertainty
  11. Altmetric Badge
    Chapter 10 Maximizing the Guarded Boundary of an Art Gallery Is APX-Complete
  12. Altmetric Badge
    Chapter 11 An Improved Algorithm for Point Set Pattern Matching under Rigid Motion
  13. Altmetric Badge
    Chapter 12 Unlocking the Advantages of Dynamic Service Selection and Pricing
  14. Altmetric Badge
    Chapter 13 The Relative Worst Order Ratio for On-Line Algorithms
  15. Altmetric Badge
    Chapter 14 On-Line Stream Merging, Max Span, and Min Coverage
  16. Altmetric Badge
    Chapter 15 Randomised Algorithms for Finding Small Weakly-Connected Dominating Sets of Regular Graphs
  17. Altmetric Badge
    Chapter 16 Additive Spanners for k -Chordal Graphs
  18. Altmetric Badge
    Chapter 17 Graph-Modeled Data Clustering: Fixed-Parameter Algorithms for Clique Generation
  19. Altmetric Badge
    Chapter 18 Reconciling Gene Trees to a Species Tree
  20. Altmetric Badge
    Chapter 19 Generating All Forest Extensions of a Partially Ordered Set
  21. Altmetric Badge
    Chapter 20 Indexing Structures for Approximate String Matching
  22. Altmetric Badge
    Chapter 21 Approximation Hardness for Small Occurrence Instances of NP-Hard Problems
  23. Altmetric Badge
    Chapter 22 Fast Approximation of Minimum Multicast Congestion — Implementation versus Theory
  24. Altmetric Badge
    Chapter 23 Approximation of a Retrieval Problem for Parallel Disks
  25. Altmetric Badge
    Chapter 24 On k -Edge-Connectivity Problems with Sharpened Triangle Inequality
  26. Altmetric Badge
    Chapter 25 The Complexity of Detecting Fixed-Density Clusters
  27. Altmetric Badge
    Chapter 26 Nearly Bounded Error Probabilistic Sets
  28. Altmetric Badge
    Chapter 27 Some Properties of MOD m Circuits Computing Simple Functions
  29. Altmetric Badge
    Chapter 28 XOR-Based Schemes for Fast Parallel IP Lookups
  30. Altmetric Badge
    Chapter 29 The Impact of Network Structure on the Stability of Greedy Protocols
  31. Altmetric Badge
    Chapter 30 Improving Customer Proximity to Railway Stations
  32. Altmetric Badge
    Chapter 31 Differential Approximation for Some Routing Problems
Attention for Chapter 14: On-Line Stream Merging, Max Span, and Min Coverage
Altmetric Badge

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
2 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
On-Line Stream Merging, Max Span, and Min Coverage
Chapter number 14
Book title
Algorithms and Complexity
Published by
Springer, Berlin, Heidelberg, May 2003
DOI 10.1007/3-540-44849-7_14
Book ISBNs
978-3-54-040176-6, 978-3-54-044849-5
Authors

Wun-Tat Chan, Tak-Wah Lam, Hing-Fung Ting, Prudence W. H. Wong

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 2 100%

Demographic breakdown

Readers by professional status Count As %
Other 1 50%
Unknown 1 50%
Readers by discipline Count As %
Computer Science 1 50%
Unknown 1 50%