Alexander Zelikovsky is a professor of computer science at Georgia State University. He is known for an approximation algorithm for the minimum Steiner tree problem with an approximation ratio 1.55,[1] widely cited by his peers[2] and also widely held in libraries.[3]

References

  1. ^ "Improved Steiner Tree Approximation in Graphs". 2000. pp. 770–779. CiteSeerX 10.1.1.42.2446.
  2. ^ "Alexander Zelikovsky". Retrieved August 6, 2016.
  3. ^ "Zelikovsky, Alexander". worldcat.org. Retrieved August 6, 2016.
Allikas: https://en.wikipedia.org/wiki/Alexander_Zelikovsky
No tags for this post.