Alexander A. Ageev

Publication Activity (10 Years)

Years Active: 1990-2020
Publications (10 Years): 6

Top Topics

Scheduling Problem

Makespan Minimization

Manufacturing Cell

Processing Times

Top Venues

J. Glob. Optim.

DOOR (Supplement)

Publications

Alexander A. Ageev, Mikhail Ivanov
An Improved Approximation Algorithm for the Coupled-Task Scheduling Problem with Equal Exact Delays. MOTOR (2020)
Alexander A. Ageev
Approximating the 2-machine flow shop problem with exact delays taking two values. J. Glob. Optim. 76 (3) (2020)
Alexander A. Ageev
Approximating the 2-Machine Flow Shop Problem with Exact Delays Taking Two Values. CoRR (2017)
Alexander A. Ageev, Alexei E. Baburin
Approximating Two-Machine Flow Shop Problem with Delays When Processing Times Depend Only on Machines. DOOR (Supplement) (2016)
Alexander A. Ageev
Constant-Factor Approximations for Cycle Cover Problems. DOOR (2016)
Alexander A. Ageev, Mikhail Ivanov
Approximating Coupled-Task Scheduling Problems with Equal Exact Delays. DOOR (2016)
Alexander A. Ageev, Alexander V. Kononov
Improved Approximations for the Max k-Colored Clustering Problem. WAOA (2014)
Alexander A. Ageev, Yohann Benchetrit, András Sebö, Zoltán Szigeti
An Excluded Minor Characterization of Seymour Graphs. IPCO (2011)
Alexander A. Ageev
A 3/2-Approximation for the Proportionate Two-Machine Flow Shop Scheduling with Minimum Delays. WAOA (2007)
Alexander A. Ageev, Alexei E. Baburin
Approximation algorithms for UET scheduling problems with exact delays. Oper. Res. Lett. 35 (4) (2007)
Alexander A. Ageev, Artem V. Pyatkin
A 2-Approximation Algorithm for the Metric 2-Peripatetic Salesman Problem. WAOA (2007)
Alexander A. Ageev, Aleksei V. Fishkin, Alexander V. Kononov, Sergey V. Sevastianov
Open block scheduling in optical communication networks. Theor. Comput. Sci. 361 (2-3) (2006)
Alexander A. Ageev, Alexander V. Kononov
Approximation Algorithms for Scheduling Problems with Exact Delays. WAOA (2006)
Alexander A. Ageev, Maxim Sviridenko
Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee. J. Comb. Optim. 8 (3) (2004)
Alexander A. Ageev, Yinyu Ye, Jiawei Zhang
-Level Facility Location Problem. SIAM J. Discret. Math. 18 (1) (2004)
Alexander A. Ageev, Yinyu Ye, Jiawei Zhang
Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem. ICALP (2003)
Alexander A. Ageev, Aleksei V. Fishkin, Alexander V. Kononov, Sergey V. Sevastianov
Open Block Scheduling in Optical Communication Networks. WAOA (2003)
Alexander A. Ageev
Improved Approximation Algorithms for Multilevel Facility Location Problems. APPROX (2002)
Alexander A. Ageev
Improved approximation algorithms for multilevel facility location problems. Oper. Res. Lett. 30 (5) (2002)
Alexander A. Ageev
Complexity of finding a join of maximum weight. Discret. Appl. Math. 114 (1-3) (2001)
Alexander A. Ageev, Refael Hassin, Maxim Sviridenko
A 0.5-Approximation Algorithm for MAX DICUT with Given Sizes of Parts. SIAM J. Discret. Math. 14 (2) (2001)
Alexander A. Ageev, Alexandr V. Kostochka
Vertex Set Partitions Preserving Conservativeness. J. Comb. Theory, Ser. B 80 (2) (2000)
Alexander A. Ageev, Maxim Sviridenko
-Cut with Given Sizes of Parts. ESA (2000)
Alexander A. Ageev, Refael Hassin, Maxim Sviridenko
An approximation algorithm for MAX DICUT with given sizes of parts. APPROX (2000)
Alexander A. Ageev
On Finding the Maximum Number of Disjoint Cuts in Seymour Graphs. ESA (1999)
Alexander A. Ageev, Maxim Sviridenko
Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts. IPCO (1999)
Alexander A. Ageev, Maxim Sviridenko
An 0.828-approximation Algorithm for the Uncapacitated Facility Location Problem. Discret. Appl. Math. 93 (2-3) (1999)
Alexander A. Ageev
Every circle graph of girth at least 5 is 3-colourable. Discret. Math. 195 (1-3) (1999)
Alexander A. Ageev, Alexandr V. Kostochka, Zoltán Szigeti
A characterization of Seymour graphs. J. Graph Theory 24 (4) (1997)
Alexander A. Ageev
A triangle-free circle graph with chromatic number 5. Discret. Math. 152 (1-3) (1996)
Alexander A. Ageev, Alexandr V. Kostochka, Zoltán Szigeti
A Characterization of Seymour Graphs. IPCO (1995)
Alexander A. Ageev
On Finding Critical Independent and Vertex Sets. SIAM J. Discret. Math. 7 (2) (1994)
Alexander A. Ageev
A Criterion of Polynomial-Time Solvability for the Network Location Problem. IPCO (1992)
Alexander A. Ageev, Vladimir L. Beresnev
Polynomially Solvable Cases of the Simple Plant Location Problem. IPCO (1990)