Erzin Adil Iliasovich

Statistics Math-Net.Ru
Total publications: 11
Scientific articles: 11

Number of views:
This page:1502
Abstract pages:2836
Full texts:793
Erzin Adil Iliasovich
Doctor of physico-mathematical sciences (2004)
Speciality: 05.13.18; 05.13.17 (Mathematical modeling, numerical methods, and the program systems; Theoretical foundation for informatics)
Birth date: 2.10.1955
E-mail: ,
Keywords: hierarchical systems structure optimization, decision making models, construction of optimal telecommunication networks, routing.


Steiner tree problem with additional restriction were investigated. For example, the construction of minimum tree, where each path from the source node to the destination is the shortest. Since such problems are NP-hard, then a simple effective heuristic approach, based on the variation of one parameter, was proposed. The a priori bounds were calculated, as well as a special cases were found when the optimal solution could be constructed by polynomial time. The results of the investigations were published in the monograph, articles and reports.


1973–1978: student; Novosibirsk State University; Mechanical-Mathematical Department; major "Mathematics, Applied Mathematics".
1978–1980: assistant; Novosibirsk Electro-Technical Institute; Department of Higher Mathematics.
1980–1983: Ph. D. student; Novosibirsk State University; Department of Theoretical Cybernetics.
1983–1984: junior researcher; Mining Institute of SD AS USSR.
1984: Ph. D. degree; Institute of Mathematics of SD AS USSR.
1984–the present: first engineer, then junior researcher, then researcher, then senior researcher; Laboratory of Operations Research; Sobolev Institute of Mathematics SD RAS.
1985–the present: (part time) first assistant professor, then associate professor; Department of Theoretical Cybernetics; Novosibirsk State University.

Main publications:
  • Erzin A. I., Cho J. D. A deep-submicron Steiner tree // J. Math. Comput. Modelling, 2000, 31(6,7), 215–226.
  • Erzin A. I., Cho J. D. The signal synchronization problem in VLSI design // Proc. of 7th Int. Conf. On Informations Networks, Systems and Technologies (ICINASTe-2001). V. 1. Minsk, 2001, 230–235.\Bibitem{1}
  • A.I. Erzin, S.N. Astrakov. Covering a Plane with Ellipses // Optimization: A J. of Mat. Programming and OR, 2013, vol 62, issue 10, pages 1357-1366
  • S.N. Astrakov, A.I. Erzin. Efficient Band Monitoring with Sensors Outer Positioning // Optimization: A J. of Mat. Programming and OR. 2013. Volume: 62, Issue: 10, pages 1367-1378
  • A.I. Erzin, P.V. Plotnikov, Yu.V. Shamardin. On some polynomially solvable cases and approximate algorithms in the optimal communication tree construction problem // Journal of Applied and Industrial Mathematics, 2013, Vol. 7, No. 2, pp. 142–152
  • Erzin A.I., Plotnikov R.V. Wireless Sensor Network’s Lifetime Maximization Problem in Case of Given Set of Covers // LNCS 6786, pp. 44–57, 2011
  • Erzin A.I., Astrakov S.N. Min-Density Stripe Covering and Applications in Sensor Networks // LNCS 6784, pp. 152–162, 2011
  • Zalyubovskiy V., Erzin A., Astrakov S., Choo H. Energy-efficient Area Coverage by Sensors with Adjustable Ranges // Sensors, 2009, 9(4), 2446-2460
  • Erzin A.I., Takhonov I.I. Equilibrium Resource Distribution in a Network Model // Journal of Applied and Industrial Mathematics, 2007, Vol. 1, No. 3, 293-302
List of publications on Google Scholar
List of publications on ZentralBlatt

Publications in Math-Net.Ru
1. About density of a covering of a strip with identical sectors
A. I. Erzin, N. A. Shabelnikova
Diskretn. Anal. Issled. Oper., 22:4 (2015),  21–34
2. Some polynomially solvable cases and approximation algorithms for optimal communication tree construction problem
A. I. Erzin, R. V. Plotnikov, Yu. V. Shamardin
Diskretn. Anal. Issled. Oper., 20:1 (2013),  12–27
3. On maximization of sensor network's lifetime subject to the limited resources
A. I. Erzin, R. V. Plotnikov
Diskretn. Anal. Issled. Oper., 18:6 (2011),  17–32
4. The Coverage of a Planar Region by Randomly Deployed Sensors
T. A. Aldyn-ool, A. I. Erzin, V. V. Zalyubovskiy
Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform., 10:4 (2010),  7–25
5. Elmor model-based algorithm to select optimal connections on the clock tree
A. I. Erzin, H. Chu
Avtomat. i Telemekh., 2009, no. 10,  172–183
6. Sensor networks and covering of plane by discs
S. N. Astrakov, A. I. Erzin, V. V. Zalyubovskiy
Diskretn. Anal. Issled. Oper., 16:3 (2009),  3–19
7. On the Reliability of Series-Parallel Networks in Grid Graphs
T. A. Aldyn-ool, A. I. Erzin
Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform., 9:2 (2009),  3–14
8. The problem of the search for a balanced flow
A. I. Erzin, I. I. Tfkhanov
Sib. Zh. Ind. Mat., 9:4 (2006),  50–63
9. Equilibrium resource distribution in a network model
A. I. Erzin, I. I. Tfkhanov
Sib. Zh. Ind. Mat., 8:3 (2005),  58–68
10. Concurrent Placement and Routing in the Design of Integrated Circuits
A. I. Erzin, D. D. Cho
Avtomat. i Telemekh., 2003, no. 12,  177–190
11. Skew Minimization Problem with Possible Sink Displacement
A. I. Erzin, D. D. Cho
Avtomat. i Telemekh., 2003, no. 3,  163–176

Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2019