Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Papadopoulos, Kleitos"'
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 $n$ strings of length $m$, the problem is to construct a trie-like tree struc
Externí odkaz:
http://arxiv.org/abs/2404.02354
Autor:
Papadopoulos, Kleitos
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 cornerstone within the domain of lot-sizing problems. It is also applicable
Externí odkaz:
http://arxiv.org/abs/2403.16314
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 predefined velocity and is only allowed to move along the edges of the grap
Externí odkaz:
http://arxiv.org/abs/1904.09142
Autor:
Bilò, Davide, Papadopoulos, Kleitos
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 papers show that the maximum stretch factor of the tree where a failing
Externí odkaz:
http://arxiv.org/abs/1807.03331
Autor:
Bilò, Davide, Papadopoulos, Kleitos
Given a 2-edge connected, unweighted, and undirected graph $G$ with $n$ vertices and $m$ edges, a $\sigma$-tree spanner is a spanning tree $T$ of $G$ in which the ratio between the distance in $T$ of any pair of vertices and the corresponding distanc
Externí odkaz:
http://arxiv.org/abs/1807.01260
In the gas station problem we want to find the cheapest path between two vertices of an $n$-vertex graph. Our car has a specific fuel capacity and at each vertex we can fill our car with gas, with the fuel cost depending on the vertex. Furthermore, w
Externí odkaz:
http://arxiv.org/abs/1706.00195
Publikováno v:
In Journal of Computer and System Sciences February 2021 115:246-263
Publikováno v:
In Information Processing Letters March 2018 131:55-59