6 citations · 32 across the 37 of their papers we have counts for
12 papers · 1 filter
Graph Connectivity with Noisy Queries
Dimitris Fotakis, Evangelia Gergatsouli, Charilaos Pipis +2
Graph connectivity is a fundamental combinatorial optimization problem that arises in many practical applications, where usually a spanning subgraph of a network is used for its op…
On the Approximability of Multistage Min-Sum Set Cover
Dimitris Fotakis, Panagiotis Kostopanagiotis, Vasileios Nakos +2
We investigate the polynomial-time approximability of the multistage version of Min-Sum Set Cover (), a natural and intriguing generalization of the classical List U…
Improved Bounds for Online Facility Location with Predictions
Dimitris Fotakis, Evangelia Gergatsouli, Themis Gouleakis +2
We consider Online Facility Location in the framework of learning-augmented online algorithms. In Online Facility Location (OFL), demands arrive one-by-one in a metric space and mu…
Memoryless Algorithms for the Generalized -server Problem on Uniform Metrics
Dimitris Christou, Dimitris Fotakis, Grigorios Koumoutsos
We consider the generalized -server problem on uniform metrics. We study the power of memoryless algorithms and show tight bounds of on their competitive ratio. In parti…
The Online Min-Sum Set Cover Problem
Dimitris Fotakis, Loukas Kavouras, Grigorios Koumoutsos +2
We consider the online Min-Sum Set Cover (MSSC), a natural and intriguing generalization of the classical list update problem. In Online MSSC, the algorithm maintains a permutation…
Reallocating Multiple Facilities on the Line
Dimitris Fotakis, Loukas Kavouras, Panagiotis Kostopanagiotis +3
We study the multistage -facility reallocation problem on the real line, where we maintain facility locations over stages, based on the stage-dependent locations of …