10 citations · 26 across the 13 of their papers we have counts for
15 papers
Optimal placement of mobile distance-limited devices for line routing\
Adil Erzin, Anzhela Shadrina
A segment (barrier) is specified on the plane, as well as depots, where the mobile devices (drones) can be placed. Each drone departs from its depot to the barrier, moves along the…
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…
A approximation for big two-bar charts packing problem
Adil Erzin, Alexander Kononov, Georgii Melidi +1
Two-Bar Charts Packing Problem is to pack two-bar charts (2-BCs) in a minimal number of unit-capacity bins. This problem generalizes the strongly NP-hard Bin Packing Problem. W…
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…
An Improved Approximation for Packing Big Two-Bar Charts
Adil Erzin, Vladimir Shenmaier
Recently, we presented a new 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…