1 citations · 2 across the 6 of their papers we have counts for
4 papers · 1 filter
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…
Dynamic Geometric Independent Set
Sujoy Bhore, Jean Cardinal, John Iacono +1
We present fully dynamic approximation algorithms for the Maximum Independent Set problem on several types of geometric objects: intervals on the real line, arbitrary axis-aligned…
Sublinear Explicit Incremental Planar Voronoi Diagrams
Elena Arseneva, John Iacono, Grigorios Koumoutsos +2
A data structure is presented that explicitly maintains the graph of a Voronoi diagram of point sites in the plane or the dual graph of a convex hull of points in three dimensi…
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…