Biography:Alexander Zelikovsky
From HandWiki
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] widely cited by his peers[2] and also widely held in libraries.[3]
References
- ↑ Robins, Gabriel; Zelikovsky, Alexander. "Improved Steiner tree approximation in graphs". SODA '00: Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms: 770-779. https://dl.acm.org/doi/10.5555/338219.338638.
- ↑ "Alexander Zelikovsky". https://scholar.google.com/citations?user=UzCRNJwAAAAJ&hl=en.
- ↑ "Zelikovsky, Alexander". worldcat.org. https://www.worldcat.org/identities/lccn-nb2005019011/.
 |  |
