Follow
Alexander Ageev
Alexander Ageev
Sobolev Institute of Mathematics
Verified email at math.nsc.ru
Title
Cited by
Cited by
Year
Pipage rounding: A new method of constructing algorithms with proven performance guarantee
AA Ageev, MI Sviridenko
Journal of Combinatorial Optimization 8, 307-328, 2004
4722004
Approximation algorithms for maximum coverage and max cut with given sizes of parts
AA Ageev, MI Sviridenko
International Conference on Integer Programming and Combinatorial …, 1999
1851999
An 0.828-approximation algorithm for the uncapacitated facility location problem
AA Ageev, MI Sviridenko
Discrete Applied Mathematics 93 (2-3), 149-156, 1999
991999
Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem
A Ageev, Y Ye, J Zhang
SIAM Journal on Discrete Mathematics 18 (1), 207-217, 2004
842004
Approximation algorithms for UET scheduling problems with exact delays
AA Ageev, AE Baburin
Operations Research Letters 35 (4), 533-540, 2007
532007
A triangle-free circle graph with chromatic number 5
AA Ageev
Discrete Mathematics 152 (1-3), 295-298, 1996
491996
Improved approximation algorithms for multilevel facility location problems
A Ageev
International Workshop on Approximation Algorithms for Combinatorial …, 2002
452002
A 0.5-approximation algorithm for max dicut with given sizes of parts
A Ageev, R Hassin, M Sviridenko
SIAM Journal on Discrete Mathematics 14 (2), 246-255, 2001
402001
Approximation algorithms for scheduling problems with exact delays
AA Ageev, AV Kononov
International Workshop on Approximation and Online Algorithms, 1-14, 2006
342006
An Approximation Algorithm for Hypergraph Max k-Cut with Given Sizes of Parts
AA Ageev, MI Sviridenko
European Symposium on Algorithms, 32-41, 2000
342000
On finding critical independent and vertex sets
AA Ageev
SIAM Journal on Discrete Mathematics 7 (2), 293-295, 1994
331994
A 3/4-approximation algorithm for finding two disjoint Hamiltonian cycles of maximum weight
AA Ageev, AE Baburin, EK Gimadi
Journal of Applied and Industrial Mathematics 1, 142-147, 2007
232007
A Criterion of Polynomial-Time Solvability for the Network Location Problem.
AA Ageev
IPCO, 237-245, 1992
231992
Approximation polynomial algorithm for the data editing and data cleaning problem
AA Ageev, AV Kel’Manov, AV Pyatkin, SA Khamidullin, VV Shenmaier
Pattern Recognition and Image Analysis 27, 365-370, 2017
222017
Computational complexity of the graph approximation problem
AA Ageev, VP Il’ev, AV Kononov, AS Talevnin
Journal of Applied and Industrial Mathematics 1, 1-8, 2007
222007
Every circle graph of girth at least 5 is 3-colourable
AA Ageev
Discrete mathematics 195 (1-3), 229-233, 1999
191999
Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem
A Ageev, Y Ye, J Zhang
International Colloquium on Automata, Languages, and Programming, 145-156, 2003
172003
Polynomially solvable cases of the simple plant location problem
AA Ageev, VL Beresnev
Proceedings of the 1st Integer Programming and Combinatorial Optimization …, 1990
171990
NP-hardness of the Euclidean max-cut problem
AA Ageev, AV Kel’Manov, AV Pyatkin
Doklady Mathematics 89, 343-345, 2014
162014
Improved approximations for the max k-colored clustering problem
A Ageev, A Kononov
International Workshop on Approximation and Online Algorithms, 1-10, 2014
142014
The system can't perform the operation now. Try again later.
Articles 1–20