42 citations · 43 across the 7 of their papers we have counts for
9 papers
Emergency Vertex Cover
Eric Angel, Evangelos Bampas, Evripidis Bampis +4
The Minimum Vertex Cover problem is a fundamental combinatorial optimization problem, aiming to identify a minimum subset of vertices in a graph such that every edge is incident to…
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…
Minimizing Total Completion Time in Multiprocessor Job Systems with Energy Constraint
Alexander Kononov, Yulia Kovalenko
We consider the problem of scheduling multiprocessor jobs to minimize the total completion time under the given energy budget. Each multiprocessor job requires more than one proces…
On a borderline between the NP-hard and polynomial-time solvable cases of the flow shop with job-dependent storage requirements
Alexander Kononov, Julia Memar, Yakov Zinder
The paper is concerned with the two-machine flow shop, where each job requires an additional resource (referred to as storage space) from the start of its first operation till the…
A polynomial-time algorithm for the routing flow shop problem with two machines: an asymmetric network with a fixed number of nodes
Ilya Chernykh, Alexander Kononov, Sergey Sevastyanov
We consider the routing flow shop problem with two machines on an asymmetric network. For this problem we discuss properties of an optimal schedule and present a polynomial time al…
LP-based algorithms for multistage minimization problems
Evripidis Bampis, Bruno Escoffier, Alexander Kononov
We consider a multistage framework introduced recently where, given a time horizon t=1,2,...,T, the input is a sequence of instances of a (static) combinatorial optimization proble…
Approximate Schedules for Non-Migratory Parallel Jobs in Speed-Scaled Multiprocessor Systems
Alexander Kononov, Yulia Kovalenko
We consider a problem of scheduling rigid parallel jobs on variable speed processors so as to minimize the total energy consumption. Each job is specified by its processing volume…
Energy Efficient Scheduling and Routing via Randomized Rounding
Evripidis Bampis, Alexander Kononov, Dimitrios Letsios +2
We propose a unifying framework based on configuration linear programs and randomized rounding, for different energy optimization problems in the dynamic speed-scaling setting. We…
Bounded Max-Colorings of Graphs
Evripidis Bampis, Alexander Kononov, Giorgio Lucarelli +1
In a bounded max-coloring of a vertex/edge weighted graph, each color class is of cardinality at most and of weight equal to the weight of the heaviest vertex/edge in this clas…