activity
20202025
collaborators

5 papers

cs.DS2025

Decision-Theoretic Approaches for Improved Learning-Augmented Algorithms

Spyros Angelopoulos, Christoph Dürr, Georgii Melidi

We initiate the systematic study of decision-theoretic metrics in the design and analysis of algorithms with machine-learned predictions. We introduce approaches based on both dete…

cs.DS2024

Scenario-Based Robust Optimization of Tree Structures

Spyros Angelopoulos, Christoph Dürr, Alex Elenter +1

We initiate the study of tree structures in the context of scenario-based robust optimization. Specifically, we study Binary Search Trees (BSTs) and Huffman coding, two fundamental…

math.OC2022

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…

cs.DM2021

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…

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…