7 citations · 7 across the 6 of their papers we have counts for
10 papers
Monge matrix searching for lot sizing with piecewise-concave production costs
Kleitos Papadopoulos
We study single-item lot sizing with piecewise-concave production and holding--backlog costs over periods. Production has common positive finite breakpoints, and stock cost…
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…
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…
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…
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…
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…
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…
An Interesting Structural Property Related to the Problem of Computing All the Best Swap Edges of a Tree Spanner in Unweighted Graphs
Davide Bilò, Kleitos Papadopoulos
In this draft we prove an interesting structural property related to the problem of computing {\em all the best swap edges} of a {\em tree spanner} in unweighted graphs. Previous p…
A Novel Algorithm for the All-Best-Swap-Edge Problem on Tree Spanners
Davide Bilò, Kleitos Papadopoulos
Given a 2-edge connected, unweighted, and undirected graph with vertices and edges, a -tree spanner is a spanning tree of in which the ratio between the dist…
A fast algorithm for the gas station problem
Kleitos Papadopoulos, Demetres Christofides
In the gas station problem we want to find the cheapest path between two vertices of an -vertex graph. Our car has a specific fuel capacity and at each vertex we can fill our ca…