Jump to content

Alexander Zelikovsky

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Citation bot (talk | contribs) at 22:07, 24 July 2023 (Alter: template type. | Use this bot. Report bugs. | #UCB_CommandLine). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Alexander Zelikovsky
Education
Known for
AwardsSociety for Industrial and Applied Mathematics (SIAM) Outstanding Paper Prize
Scientific career
FieldsComputer Science, Computational Biology, Bioinformatics, Combinatorial Optimization, Wireless sensor networks
InstitutionsGeorgia State University

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.