# The Online Min-Sum Set Cover Problem

@article{Fotakis2020TheOM,
title={The Online Min-Sum Set Cover Problem},
author={Dimitris Fotakis and Loukas Kavouras and Grigorios Koumoutsos and Stratis Skoulakis and Manolis Vardas},
journal={ArXiv},
year={2020},
volume={abs/2003.02161}
}
• Published 4 March 2020
• Computer Science
• ArXiv

### Competitive Algorithms for Generalized k-Server in Uniform Metrics

• Computer Science, Mathematics
SODA
• 2018
The generalized k-server problem is considered in uniform metrics and the first f(k)-competitive algorithms for general k are given, including a deterministic and randomized algorithms with competitive ratio $O(k 2^k)$ and $O (k^3 \log k)$ respectively.

### An Input Sensitive Online Algorithm for the Metric Bipartite Matching Problem

• Computer Science, Mathematics
2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)
• 2017
A novel input sensitive analysis of a deterministic online algorithm for the minimum metric bipartite matching problem and shows that the cost of edges of the optimal matching inside each larger ball can be shown to be proportional to the weight times the radius of the larger ball.

### Approximating Min Sum Set Cover

• Computer Science
Algorithmica
• 2004
For the min sum vertex cover version of the problem, it is shown that it can be approximated within a ratio of 2, and is NP-hard to approximate within some constant ρ > 1.

### A constant factor approximation algorithm for generalized min-sum set cover

• Computer Science, Mathematics
SODA '10
• 2010
A simple randomized constant factor approximation algorithm is given for the generalized min-sum set cover problem, which is given a universe of elements and a collection of subsets with each set S having a covering requirement.

### Chasing Convex Bodies Optimally

The functional Steiner point of a convex function is defined and applied to the work function to obtain the algorithm achieving competitive ratio d for arbitrary normed spaces, which is exactly tight for $\ell^{\infty}$.

### Stochastic Online Metric Matching

• Computer Science, Mathematics
ICALP
• 2019
The main result is an $O((\log \log n)^2)$-competitive algorithm in this model, which implies a strict separation between the i.i.d model and the adversarial and random order models, both for general metrics and these much-studied metrics.

### On Chromatic Sums and Distributed Resource Allocation

• Computer Science
Inf. Comput.
• 1996
TheMinimum Edge Color Sum (MECS) problem, which is shown to be NP-hard, is introduced and it is shown that ann1−e-approximation is NP- hard, for somee>0.

### Minimum Latency Submodular Cover

• Mathematics, Computer Science
ICALP
• 2012
A natural stochastic extension of the Submodular Ranking problem is studied and an adaptive algorithm with an O(log 1/ε)-approximation ratio is obtained, which is best possible.