×

zbMATH — the first resource for mathematics

Il’ev, Victor Petrovich

Compute Distance To:
Author ID: ilev.victor-petrovich Recent zbMATH articles by "Il'ev, 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

Publications by Year

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.90585
Il’ev, Victor P.
4
2001
Approximation algorithms for graph approximation problems. Zbl 1249.05366
Il’ev, V. P.; Il’eva, S. D.; Navrotskaya, A. A.
3
2011
Computational complexity of the graph approximation problem. Zbl 1249.68085
Ageev, 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.05041
Il’ev, V. P.; Fridman, G. Sh.
3
1982
Performance guarantees of a greedy algorithm for minimizing a supermodular set function on comatroid. Zbl 1162.90545
Il’ev, Victor; Linker, Nick
2
2006
Approximate solution of the \(p\)-median minimization problem. Zbl 1362.90324
Il’ev, V. P.; Il’eva, S. D.; Navrotskaya, A. A.
1
2016
Approximation algorithms for approximating graphs with bounded numberof connected components. Zbl 06963892
Il’ev, V. P.; Il’eva, S. D.
1
2010
Problems on independence systems solvable by the greedy algorithm. Zbl 1237.05037
Ilyev, V. P.
1
2009
Hereditary systems and greedy-type algorithms. Zbl 1052.90063
Il’ev, Victor
1
2003
On the minimisation problem for a supermodular function over a comatroid. Zbl 1045.90051
Il’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.90034
Il’ev, V. P.
1
1998
Estimation of error of the gradient algorithm for systems of independence. Zbl 0860.90092
Il’ev, V. P.
1
1996
Approximate solution of the \(p\)-median minimization problem. Zbl 1362.90324
Il’ev, V. P.; Il’eva, S. D.; Navrotskaya, A. A.
1
2016
Approximation algorithms for graph approximation problems. Zbl 1249.05366
Il’ev, V. P.; Il’eva, S. D.; Navrotskaya, A. A.
3
2011
Approximation algorithms for approximating graphs with bounded numberof connected components. Zbl 06963892
Il’ev, V. P.; Il’eva, S. D.
1
2010
Problems on independence systems solvable by the greedy algorithm. Zbl 1237.05037
Ilyev, V. P.
1
2009
Computational complexity of the graph approximation problem. Zbl 1249.68085
Ageev, 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.90545
Il’ev, Victor; Linker, Nick
2
2006
Hereditary systems and greedy-type algorithms. Zbl 1052.90063
Il’ev, Victor
1
2003
On the minimisation problem for a supermodular function over a comatroid. Zbl 1045.90051
Il’ev, V. P.; Linker, N. V.
1
2002
An approximation guarantee of the greedy descent algorithm for minimzing a supermodular set function. Zbl 1168.90585
Il’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.90034
Il’ev, V. P.
1
1998
Estimation of error of the gradient algorithm for systems of independence. Zbl 0860.90092
Il’ev, V. P.
1
1996
On the problem of approximation by graphs with a fixed number of components. Zbl 0506.05041
Il’ev, V. P.; Fridman, G. Sh.
3
1982

Citations by Year