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

Algorithms - ESA’ 99

Overview of attention for book
Cover of 'Algorithms - ESA’ 99'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 ESA’99 Program
  3. Altmetric Badge
    Chapter 2 Adaptively-Secure Distributed Public-Key Systems
  4. Altmetric Badge
    Chapter 3 How Long Does a Bit Live in a Computer?
  5. Altmetric Badge
    Chapter 4 Approximation Algorithms for the Traveling Purchaser Problem and Its Variants in Network Design
  6. Altmetric Badge
    Chapter 5 The Impact of Knowledge on Broadcasting Time in Radio Networks
  7. Altmetric Badge
    Chapter 6 Multipacket Routing on 2-D Meshes and Its Application to Fault-Tolerant Routing
  8. Altmetric Badge
    Chapter 7 IP Address LookupMade Fast and Simple
  9. Altmetric Badge
    Chapter 8 On-Line Load Balancing in a Hierarchical Server Topology
  10. Altmetric Badge
    Chapter 9 Provably Good and Practical Strategies for Non-uniform Data Management in Networks
  11. Altmetric Badge
    Chapter 10 Approximation Algorithms for Restoration Capacity Planning
  12. Altmetric Badge
    Chapter 11 Efficient Algorithms for Integer Programs with Two Variables per Constraint
  13. Altmetric Badge
    Chapter 12 Convex Quadratic Programming Relaxations for Network Scheduling Problems
  14. Altmetric Badge
    Chapter 13 Resource-Constrained Project Scheduling:Computing Lower Bounds by Solving Minimum Cut Problems
  15. Altmetric Badge
    Chapter 14 Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines
  16. Altmetric Badge
    Chapter 15 Off-Line Temporary Tasks Assignment
  17. Altmetric Badge
    Chapter 16 Load Balancing Using Bisectors — A Tight Average-Case Analysis
  18. Altmetric Badge
    Chapter 17 On the Analysis of Evolutionary Algorithms — A Proof That Crossover Really Can Help
  19. Altmetric Badge
    Chapter 18 Motif Statistics
  20. Altmetric Badge
    Chapter 19 Approximate Protein Folding in the HP Side Chain Model on Extended Cubic Lattices (Extended Abstract)
  21. Altmetric Badge
    Chapter 20 On Constructing Suffix Arrays in External Memory
  22. Altmetric Badge
    Chapter 21 Strategies for Searching with Different Access Costs
  23. Altmetric Badge
    Chapter 22 On the Informational Asymmetry between Upper and Lower Bounds for Ultrametric Evolutionary Trees
  24. Altmetric Badge
    Chapter 23 Optimal Binary Search with Two Unreliable Tests and Minimum Adaptiveness
  25. Altmetric Badge
    Chapter 24 Improving Mergesort for Linked Lists
  26. Altmetric Badge
    Chapter 25 Efficient Algorithms for On-Line Symbol Ranking Compression
  27. Altmetric Badge
    Chapter 26 On List Update and Work Function Algorithms
  28. Altmetric Badge
    Chapter 27 The 3-Server Problem in the Plane
  29. Altmetric Badge
    Chapter 28 Quartet Cleaning: Improved Algorithms and Simulations
  30. Altmetric Badge
    Chapter 29 Fast and Robust Smallest Enclosing Balls
  31. Altmetric Badge
    Chapter 30 Efficient Searching for Multi—dimensional Data Made Simple
  32. Altmetric Badge
    Chapter 31 Geometric Searching over the Rationals
  33. Altmetric Badge
    Chapter 32 On Computing the Diameter of a Point Set in High Dimensional Euclidean Space
  34. Altmetric Badge
    Chapter 33 A Nearly Linear-Time Approximation Scheme for the Euclidean k -median Problem
  35. Altmetric Badge
    Chapter 34 Sum Multi-coloring of Graphs
  36. Altmetric Badge
    Chapter 35 Efficient Approximation Algorithms for the Achromatic Number
  37. Altmetric Badge
    Chapter 36 Augmenting a( k —1)-Vertex-ConnectedMultigraph to an ℓ -Edge-Connected and k -Vertex-Connected Multigraph
  38. Altmetric Badge
    Chapter 37 An Optimisation Algorithm for Maximum Independent Set with Applications in Map Labelling
  39. Altmetric Badge
    Chapter 38 A Decomposition Theorem for MaximumWeight Bipartite Matchings with Applications to Evolutionary Trees
  40. Altmetric Badge
    Chapter 39 Faster Exact Solutions for Some NP-Hard Problems
  41. Altmetric Badge
    Chapter 40 A Polyhedral Algorithm for Packings and Designs
  42. Altmetric Badge
    Chapter 41 Threshold Phenomena in Random Lattices and Efficient Reduction Algorithms
  43. Altmetric Badge
    Chapter 42 On Finding the Maximum Number of Disjoint Cuts in Seymour Graphs
  44. Altmetric Badge
    Chapter 43 Dilworth’s Theorem and Its Application for Path Systems of a Cycle—Implementation and Analysis
  45. Altmetric Badge
    Chapter 44 On 2-Coverings and 2-Packings of Laminar Families
  46. Altmetric Badge
    Chapter 45 Random Cayley Graphs with O(log|G|) Generators Are Expanders
  47. Altmetric Badge
    Chapter 46 A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs
  48. Altmetric Badge
    Chapter 47 A Fast General Methodology for Information—Theoretically Optimal Encodings of Graphs
Attention for Chapter 33: A Nearly Linear-Time Approximation Scheme for the Euclidean k -median Problem
Altmetric Badge

Mentioned by

wikipedia
1 Wikipedia page

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
22 Mendeley
Summary Wikipedia 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.
Chapter title
A Nearly Linear-Time Approximation Scheme for the Euclidean k -median Problem
Chapter number 33
Book title
Algorithms - ESA’ 99
Published by
Springer, Berlin, Heidelberg, July 1999
DOI 10.1007/3-540-48481-7_33
Book ISBNs
978-3-54-066251-8, 978-3-54-048481-3
Authors

Stavros G. Kolliopoulos, Satish Rao, Kolliopoulos, Stavros G., Rao, Satish

View on publisher site
Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 22 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 11 50%
Researcher 3 14%
Lecturer 1 5%
Student > Bachelor 1 5%
Student > Doctoral Student 1 5%
Other 2 9%
Unknown 3 14%
Readers by discipline Count As %
Computer Science 13 59%
Engineering 3 14%
Physics and Astronomy 2 9%
Unknown 4 18%

This page is provided by Altmetric.