Showing cs.DSShow all
2 papers · 1 filter
cs.DS2020
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…
cs.DS2019
Constructive Heuristics for Min-Power Bounded-Hops Symmetric Connectivity Problem
Roman Plotnikov, Adil Erzin
We consider a Min-Power Bounded-Hops Symmetric Connectivity problem that consists in the construction of communication spanning tree on a given graph, where the total energy consum…