Alexander Viktorovich Karzanov (Russian: Александр Викторович Карзанов, born 1947)[1] is a Russian mathematician known for his work in combinatorial optimization. He is the inventor of preflow-push based algorithms for the maximum flow problem, and the co-inventor of the Hopcroft–Karp–Karzanov algorithm for maximum matching in bipartite graphs.[2] He is a chief researcher at the Federal Research Center "Computer Science and Control" (Institute for System Analysis) of the Russian Academy of Sciences.[3]

Karzanov was educated at Moscow State University, completing his doctorate there in 1971.[1] With Georgy Adelson-Velsky and Yefim Dinitz he is the co-author of the book Потоковые алгоритмы [Flow algorithms] (Moscow: Nauka, 1975).[4] He was an invited speaker at the 1990 International Congress of Mathematicians.[5]

References

  1. 1 2 Curriculum vitae, retrieved 2019-06-26
  2. ↑ Dinitz, Yefim (2006), "Dinitz' Algorithm: The Original Version and Even's Version", in Goldreich, Oded; Rosenberg, Arnold L.; Selman, Alan L. (eds.), Theoretical Computer Science: Essays in Memory of Shimon Even, Lecture Notes in Computer Science, vol. 3895, Berlin and Heidelberg: Springer, pp. 218–240, doi:10.1007/11685654_10
  3. ↑ "Federal Research Center "Computer Science and Control" of Russian Academy of Sciences, Moscow, Russia", All-Russian Mathematical Portal, retrieved 2019-06-26
  4. ↑ Tetruasvili, M., "Review of Flow algorithms", Mathematical Reviews, MR 0446453
  5. ↑ ICM Plenary and Invited Speakers, International Mathematical Union, retrieved 2019-06-26


This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.