Alexander Zelikovsky

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by Citation bot (talk | contribs) at 22:59, 5 March 2020 (Alter: template type. Add: citeseerx. Removed URL that duplicated unique identifier. Removed accessdate with no specified URL. Removed parameters. | You can use this bot yourself. Report bugs here. | Activated by User:AManWithNoPlan | via #UCB_webform). 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" (Document). Penn State University. {{cite document}}: Unknown parameter |citeseerx= ignored (help)
  2. ^ "Alexander Zelikovsky". Retrieved August 6, 2016.
  3. ^ "Zelikovsky, Alexander". worldcat.org. Retrieved August 6, 2016.
Retrieved from "https://en.wikipedia.org/w/index.php?title=Alexander_Zelikovsky&oldid=944134332"