Alexander Zelikovsky
 | This article, Alexander Zelikovsky, has recently been created via the Articles for creation process. Please check to see if the reviewer has accidentally left this template after accepting the draft and take appropriate action as necessary.
Reviewer tools: Inform author |
| This article, Alexander Zelikovsky, has recently been created via the Articles for creation process. Please check to see if the reviewer has accidentally left this template after accepting the draft and take appropriate action as necessary.
Reviewer tools: Inform author |
Comment: Actually notable and should have been declined. SwisterTwister talk 19:53, 6 August 2016 (UTC)
- Comment: Two sentences and an infobox does not make an article. Also, there is only one source. ThePlatypusofDoom (talk) 12:51, 6 August 2016 (UTC)
Alexander Zelikovsky | |
|---|---|
| Education |
|
| Known for | |
| Awards | Society for Industrial and Applied Mathematics (SIAM) Outstanding Paper Prize, |
| Scientific career | |
| Fields | Computer Science, Computational Biology, Bioinformatics, Combinatorial Optimization, Wireless sensor networks |
| Institutions | Georgia 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]
References
- ^ "Improved Steiner Tree Approximation in Graphs". Penn State University. Retrieved August 5, 2016.