|
|
|
Publications in Math-Net.Ru |
Citations |
|
2015 |
| 1. |
A. V. Dolgushev, A. V. Kel'manov, V. V. Shenmaier, “Polynomial-time approximation scheme for a problem of partitioning a finite set into two clusters”, Trudy Inst. Mat. i Mekh. UrO RAN, 21:3 (2015), 100–109    ; Proc. Steklov Inst. Math. (Suppl.), 295, suppl. 1 (2016), 47–56  |
19
|
|
2011 |
| 2. |
A. V. Dolgushev, A. V. Kel'manov, “An approximation algorithm for one problem of cluster analysis”, Diskretn. Anal. Issled. Oper., 18:2 (2011), 29–40  ; J. Appl. Industr. Math., 5:4 (2011), 551–558  |
29
|
|
2010 |
| 3. |
A. V. Dolgushev, A. V. Kel'manov, “On the issue of algorithmic complexity of one cluster analysis problem”, Diskretn. Anal. Issled. Oper., 17:2 (2010), 39–45 |
12
|
|
| Organisations |
|
|
Contact us: