Edit Profile Il’ev, Victor Petrovich Compute Distance To: Compute Author ID: ilev.victor-petrovich Published as: Il’ev, V. P.; Il’ev, Victor; Il’ev, Victor P.; Il’ev, Victor Petrovich; Il’ev, Viktor Petrovich; Iliev, V.; Ilyev, V. P. Documents Indexed: 24 Publications since 1982 all top 5 Co-Authors 8 single-authored 4 Il’eva, S. D. 3 Navrotskaya, A. A. 2 Il’eva, Svetlana 2 Kononov, Alexander V. 2 Linker, N. V. 2 Vyplov, Mikhail Yur’evich 1 Ageev, Aleksandr Aleksandrovich 1 Baranski, Vitali Anatolyich 1 Baranskiĭ, Vitaliĭ Anatol’evich 1 Fridman, G. Sh. 1 Il’ev, Artëm Viktorovich V. 1 Morshinin, Alexander 1 Ofenbakh, I. V. 1 Talevnin, A. S. 1 Televnin, A. S. all top 5 Serials 3 Diskretnyĭ Analiz i Issledovanie Operatsiĭ. Seriya 1 3 Diskretnyĭ Analiz i Issledovanie Operatsiĭ 2 Discrete Applied Mathematics 2 Metody Diskretnogo Analiza 2 Izvestiya Irkutskogo Gosudarstvennogo Universiteta. Seriya Matematika 1 Soviet Mathematics. Doklady 1 Discrete Mathematics and Applications 1 Computational Mathematics and Mathematical Physics 1 European Journal of Operational Research 1 Diskretnyĭ Analiz i Issledovanie Operatsiĭ 1 Vestnik Omskogo Universiteta 1 Trudy Instituta Matematiki 1 Sibirskie Èlektronnye Matematicheskie Izvestiya all top 5 Fields 12 Combinatorics (05-XX) 11 Operations research, mathematical programming (90-XX) 6 Computer science (68-XX) 1 Mathematical logic and foundations (03-XX) 1 Number theory (11-XX) 1 Statistics (62-XX) Publications by Year all cited Publications top 5 cited Publications Citations contained in zbMATH 12 Publications have been cited 22 times in 14 Documents Cited by ▼ Year ▼ An approximation guarantee of the greedy descent algorithm for minimzing a supermodular set function. Zbl 1168.90585Il’ev, Victor P. 4 2001 Approximation algorithms for graph approximation problems. Zbl 1249.05366Il’ev, V. P.; Il’eva, S. D.; Navrotskaya, A. A. 3 2011 Computational complexity of the graph approximation problem. Zbl 1249.68085Ageev, A. A.; Il’ev, V. P.; Kononov, A. V.; Televnin, A. S. 3 2006 On the problem of approximation by graphs with a fixed number of components. Zbl 0506.05041Il’ev, V. P.; Fridman, G. Sh. 3 1982 Performance guarantees of a greedy algorithm for minimizing a supermodular set function on comatroid. Zbl 1162.90545Il’ev, Victor; Linker, Nick 2 2006 Approximate solution of the \(p\)-median minimization problem. Zbl 1362.90324Il’ev, V. P.; Il’eva, S. D.; Navrotskaya, A. A. 1 2016 Approximation algorithms for approximating graphs with bounded numberof connected components. Zbl 06963892Il’ev, V. P.; Il’eva, S. D. 1 2010 Problems on independence systems solvable by the greedy algorithm. Zbl 1237.05037Ilyev, V. P. 1 2009 Hereditary systems and greedy-type algorithms. Zbl 1052.90063Il’ev, Victor 1 2003 On the minimisation problem for a supermodular function over a comatroid. Zbl 1045.90051Il’ev, V. P.; Linker, N. V. 1 2002 An estimate for the accuracy of the greedy descent algorithm for the problem of minimizing a supermodular function. Zbl 0942.90034Il’ev, V. P. 1 1998 Estimation of error of the gradient algorithm for systems of independence. Zbl 0860.90092Il’ev, V. P. 1 1996 Approximate solution of the \(p\)-median minimization problem. Zbl 1362.90324Il’ev, V. P.; Il’eva, S. D.; Navrotskaya, A. A. 1 2016 Approximation algorithms for graph approximation problems. Zbl 1249.05366Il’ev, V. P.; Il’eva, S. D.; Navrotskaya, A. A. 3 2011 Approximation algorithms for approximating graphs with bounded numberof connected components. Zbl 06963892Il’ev, V. P.; Il’eva, S. D. 1 2010 Problems on independence systems solvable by the greedy algorithm. Zbl 1237.05037Ilyev, V. P. 1 2009 Computational complexity of the graph approximation problem. Zbl 1249.68085Ageev, A. A.; Il’ev, V. P.; Kononov, A. V.; Televnin, A. S. 3 2006 Performance guarantees of a greedy algorithm for minimizing a supermodular set function on comatroid. Zbl 1162.90545Il’ev, Victor; Linker, Nick 2 2006 Hereditary systems and greedy-type algorithms. Zbl 1052.90063Il’ev, Victor 1 2003 On the minimisation problem for a supermodular function over a comatroid. Zbl 1045.90051Il’ev, V. P.; Linker, N. V. 1 2002 An approximation guarantee of the greedy descent algorithm for minimzing a supermodular set function. Zbl 1168.90585Il’ev, Victor P. 4 2001 An estimate for the accuracy of the greedy descent algorithm for the problem of minimizing a supermodular function. Zbl 0942.90034Il’ev, V. P. 1 1998 Estimation of error of the gradient algorithm for systems of independence. Zbl 0860.90092Il’ev, V. P. 1 1996 On the problem of approximation by graphs with a fixed number of components. Zbl 0506.05041Il’ev, V. P.; Fridman, G. Sh. 3 1982 all cited Publications top 5 cited Publications all top 5 Cited by 20 Authors 4 Il’ev, Victor Petrovich 3 Simanchev, R. Yu. 2 Il’eva, S. D. 2 Navrotskaya, A. A. 2 Urazova, I. V. 1 Berger, André 1 Galiev, Shamil I. 1 Grigoriev, Alexander 1 Hasenbein, John J. 1 Khor’kov, A. V. 1 Kochetov, Yuriĭ Andreevich 1 Kryvtsun, O. V. 1 Laitila, Jussi 1 Lee, Jinho 1 Linker, N. V. 1 Moilanen, Atte 1 Morton, David P. 1 Popescu, Dragoş-Radu 1 Winokurow, Andrej 1 Zhou, Sanming all top 5 Cited in 9 Serials 4 Diskretnyĭ Analiz i Issledovanie Operatsiĭ 2 Computational Mathematics and Mathematical Physics 1 Discrete Applied Mathematics 1 Discrete Mathematics 1 Operations Research Letters 1 European Journal of Operational Research 1 Cybernetics and Systems Analysis 1 Discrete Optimization 1 Optimization Letters all top 5 Cited in 7 Fields 10 Operations research, mathematical programming (90-XX) 4 Combinatorics (05-XX) 2 Convex and discrete geometry (52-XX) 2 Computer science (68-XX) 1 Statistics (62-XX) 1 Numerical analysis (65-XX) 1 Biology and other natural sciences (92-XX) Citations by Year