10 citations · 22 across the 8 of their papers we have counts for
10 papers
Approximate weighted 3-coloring
Adil Erzin, Roman Plotnikov, Georgii Zhukov
The paper considers the NP-hard graph vertex coloring problem, which differs from traditional problems in which it is required to color vertices with a given (or minimal) number of…
Constrained Shortest Path and Hierarchical Structures
Adil Erzin, Roman Plotnikov, Ilya Ladygin
The Constraint Shortest Path (CSP) problem is as follows. An -vertex graph is given, each edge/arc assigned two weights. Let us call them "cost" and "length" for definiteness. F…
Approximation Algorithms for Two-Bar Charts Packing Problem
Adil Erzin, Georgii Melidi, Stepan Nazarenko +1
In the Two-Bar Charts Packing Problem (2-BCPP), it is required to pack the bar charts (BCs) consisting of two bars into the horizontal unit-height strip of minimal length. The bars…
A 3/2--approximation for big two-bar charts packing
Adil Erzin, Stepan Nazarenko, Gregory Melidi +1
We consider a Two-Bar Charts Packing Problem (2-BCPP), in which it is necessary to pack two-bar charts (2-BCs) in a unit-height strip of minimum length. The problem is a generaliza…
Optimal Investment in the Development of Oil and Gas Field
Adil Erzin, Roman Plotnikov, Alexei Korobkin +2
Let an oil and gas field consists of clusters in each of which an investor can launch at most one project. During the implementation of a particular project, all characteristics ar…
Two-Bar Charts Packing Problem
Adil Erzin, Gregory Melidi, Stepan Nazarenko +1
We consider a Bar Charts Packing Problem (BCPP), in which it is necessary to pack bar charts (BCs) in a strip of minimum length. The problem is, on the one hand, a generalization o…