activity
20172026
collaborators
Showing cs.DSShow all

7 papers · 1 filter

cs.DS2026

An -Time Algorithm for Optimal Broadcast Domination

Kleitos Papadopoulos

Broadcast domination assigns a nonnegative integer power to every vertex of a graph so that every vertex is within the assigned power of some broadcasting vertex, and the objective…

cs.DS2026

An Time Algorithm for the Generalized Egg Dropping Problem

Kleitos Papadopoulos

The generalized egg dropping problem is a classic challenge in sequential decision-making. Standard dynamic programming evaluates the minimax minimum number of tests in $\mathcal{O…

cs.DS2025

An Algorithm for Single-Item Lot Sizing with a One-Breakpoint All-Units Discount and Non-Increasing Prices

Kleitos Papadopoulos

This paper addresses the single-item lot sizing problem with a 1-breakpoint all-units quantity discount in a monotonic setting where the purchase prices are non-increasing over the…

cs.DS2024

A faster algorithm for the construction of optimal factoring automata

Thomas Erlebach, Kleitos Papadopoulos

The problem of constructing optimal factoring automata arises in the context of unification factoring for the efficient execution of logic programs. Given an ordered set of str…

cs.DS2024

A Novel exact algorithm for economic lot-sizing with piecewise linear production costs

Kleitos Papadopoulos

In this paper, we study the single-item economic lot-sizing problem with production cost functions that are piecewise linear. The lot-sizing problem stands as a foundational corner…

cs.DS2019

An Efficient Algorithm for the Fast Delivery Problem

Iago A. Carvalho, Thomas Erlebach, Kleitos Papadopoulos

We study a problem where k autonomous mobile agents are initially located on distinct nodes of a weighted graph (with n nodes and m edges). Each autonomous mobile agent has a prede…