|
|
|
Publications in Math-Net.Ru |
Citations |
|
2020 |
| 1. |
V. P. Il'ev, S. D. Il'eva, A. V. Morshinin, “$2$-Approximation algorithms for two graph clustering problems”, Diskretn. Anal. Issled. Oper., 27:3 (2020), 88–108  ; J. Appl. Industr. Math., 14:3 (2020), 490–502  |
1
|
|
2019 |
| 2. |
V. P. Il'ev, S. D. Il'eva, A. V. Morshinin, “Approximate algorithms for graph clustering problem”, Prikl. Diskr. Mat., 2019, no. 45, 64–77 |
|
2016 |
| 3. |
V. P. Il'ev, S. D. Il'eva, A. A. Navrotskaya, “Graph clustering with a constraint on cluster sizes”, Diskretn. Anal. Issled. Oper., 23:3 (2016), 5–20   ; J. Appl. Industr. Math., 10:3 (2016), 341–348 |
5
|
| 4. |
V. P. Il'ev, S. D. Il'eva, A. A. Navrotskaya, “Approximate solution of the $p$-median minimization problem”, Zh. Vychisl. Mat. Mat. Fiz., 56:9 (2016), 1614–1621 ; Comput. Math. Math. Phys., 56:9 (2016), 1591–1597  |
2
|
|
2011 |
| 5. |
V. P. Il'ev, S. D. Il'eva, A. A. Navrotskaya, “Approximation algorithms for graph approximation problems”, Diskretn. Anal. Issled. Oper., 18:1 (2011), 41–60  ; J. Appl. Industr. Math., 5:4 (2011), 569–581 |
7
|
|
2010 |
| 6. |
V. P. Il'ev, S. D. Il'eva, “Approximation algorithms for approximating graphs with bounded numberof connected components”, Tr. Inst. Mat., 18:1 (2010), 47–52 |
1
|
|
| Organisations |
|
| |
|
|
Contact us: