Alexander A. Ageev

According to our database, Alexander A. Ageev authored at least 31 papers between 1990 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2021

How Fast Can the Uniform Capacitated Facility Location Problem Be Solved on Path Graphs.

Alexander A. Ageev, Edward Gimadi, Alexandr A. Shtepa

Proceedings of the Analysis of Images, Social Networks and Texts, 2021

2020

Approximating the 2-machine flow shop problem with exact delays taking two values.

Alexander A. Ageev

J. Glob. Optim., 2020

An Improved Approximation Algorithm for the Coupled-Task Scheduling Problem with Equal Exact Delays.

Alexander A. Ageev, Mikhail Ivanov

Proceedings of the Mathematical Optimization Theory and Operations Research, 2020

2016

Approximating Coupled-Task Scheduling Problems with Equal Exact Delays.

Alexander A. Ageev, Mikhail Ivanov

Proceedings of the Discrete Optimization and Operations Research, 2016

Approximating Two-Machine Flow Shop Problem with Delays When Processing Times Depend Only on Machines.

Alexander A. Ageev, Alexei E. Baburin

Proceedings of the Supplementary Proceedings of the 9th International Conference on Discrete Optimization and Operations Research and Scientific School (DOOR 2016), Vladivostok, Russia, September 19, 2016

Constant-Factor Approximations for Cycle Cover Problems.

Alexander A. Ageev

Proceedings of the Discrete Optimization and Operations Research, 2016

2014

Improved Approximations for the Max k-Colored Clustering Problem.

Alexander A. Ageev, Alexander V. Kononov

Proceedings of the Approximation and Online Algorithms - 12th International Workshop, 2014

2011

An Excluded Minor Characterization of Seymour Graphs.

Alexander A. Ageev, Yohann Benchetrit, András Sebö, Zoltán Szigeti

Proceedings of the Integer Programming and Combinatoral Optimization, 2011

2007

Approximation algorithms for UET scheduling problems with exact delays.

Alexander A. Ageev, Alexei E. Baburin

Oper. Res. Lett., 2007

A 2-Approximation Algorithm for the Metric 2-Peripatetic Salesman Problem.

Alexander A. Ageev, Artem V. Pyatkin

Proceedings of the Approximation and Online Algorithms, 5th International Workshop, 2007

A 3/2-Approximation for the Proportionate Two-Machine Flow Shop Scheduling with Minimum Delays.

Alexander A. Ageev

Proceedings of the Approximation and Online Algorithms, 5th International Workshop, 2007

2006

Open block scheduling in optical communication networks.

Alexander A. Ageev, Aleksei V. Fishkin, Alexander V. Kononov, Sergey V. Sevastianov

Theor. Comput. Sci., 2006

Approximation Algorithms for Scheduling Problems with Exact Delays.

Alexander A. Ageev, Alexander V. Kononov

Proceedings of the Approximation and Online Algorithms, 4th International Workshop, 2006

2004

Improved Combinatorial Approximation Algorithms for the <i>k</i>-Level Facility Location Problem.

Alexander A. Ageev, Yinyu Ye, Jiawei Zhang

SIAM J. Discret. Math., 2004

Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee.

Alexander A. Ageev, Maxim Sviridenko

J. Comb. Optim., 2004

2003

Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem.

Alexander A. Ageev, Yinyu Ye, Jiawei Zhang

Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002

Improved approximation algorithms for multilevel facility location problems.

Alexander A. Ageev

Oper. Res. Lett., 2002

2001

A 0.5-Approximation Algorithm for MAX DICUT with Given Sizes of Parts.

Alexander A. Ageev, Refael Hassin, Maxim Sviridenko

SIAM J. Discret. Math., 2001

Complexity of finding a join of maximum weight.

Alexander A. Ageev

Discret. Appl. Math., 2001

2000

Vertex Set Partitions Preserving Conservativeness.

Alexander A. Ageev, Alexandr V. Kostochka

J. Comb. Theory, Ser. B, 2000

An Approximation Algorithm for Hypergraph Max <i>k</i>-Cut with Given Sizes of Parts.

Alexander A. Ageev, Maxim Sviridenko

Proceedings of the Algorithms, 2000

An approximation algorithm for MAX DICUT with given sizes of parts.

Alexander A. Ageev, Refael Hassin, Maxim Sviridenko

Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2000

1999

Every circle graph of girth at least 5 is 3-colourable.

Alexander A. Ageev

Discret. Math., 1999

An 0.828-approximation Algorithm for the Uncapacitated Facility Location Problem.

Alexander A. Ageev, Maxim Sviridenko

Discret. Appl. Math., 1999

Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts.

Alexander A. Ageev, Maxim Sviridenko

Proceedings of the Integer Programming and Combinatorial Optimization, 1999

On Finding the Maximum Number of Disjoint Cuts in Seymour Graphs.

Alexander A. Ageev

Proceedings of the Algorithms, 1999

1997

A characterization of Seymour graphs.

Alexander A. Ageev, Alexandr V. Kostochka, Zoltán Szigeti

J. Graph Theory, 1997

1996

A triangle-free circle graph with chromatic number 5.

Alexander A. Ageev

Discret. Math., 1996

1994

On Finding Critical Independent and Vertex Sets.

Alexander A. Ageev

SIAM J. Discret. Math., 1994

1992

A Criterion of Polynomial-Time Solvability for the Network Location Problem.

Alexander A. Ageev

Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, 1992

1990

Polynomially Solvable Cases of the Simple Plant Location Problem.

Alexander A. Ageev, Vladimir L. Beresnev

Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, 1990