The Online Min-Sum Set Cover Problem

  title={The Online Min-Sum Set Cover Problem},
  author={Dimitris Fotakis and Loukas Kavouras and Grigorios Koumoutsos and Stratis Skoulakis and Manolis Vardas},
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 on $n$ elements based on subsets $S_1, S_2, \ldots$ arriving online. The algorithm serves each set $S_t$ upon arrival, using its current permutation $\pi_{t}$, incurring an access cost equal to the position of the first element of $S_t$ in $\pi_{t}$. Then, the algorithm may update its permutation to $\pi_{t+1… 

Figures from this paper

Efficient Online Learning of Optimal Rankings: Dimensionality Reduction via Gradient Descent

This work shows how to achieve low regret for GMSSC in polynomial-time by employing dimensionality reduction from rankings to the space of doubly stochastic matrices, where it is shown how subgradients can be computed efficiently, by solving the dual of a configuration LP.

On the Approximability of Multistage Min-Sum Set Cover

The polynomial-time approximability of the multistage version of Min-Sum Set Cover (Mult-MSSC), a natural and intriguing generalization of the classical List Update problem, can be approximated within a factor of O(log2 n) in general instances, by randomized rounding, and within a Factor O(r2), if all requests have cardinality at most r.

An Improved Algorithm For Online Reranking

A computationally efficient randomized algorithm whose competitive ratio (A lg -to-O pt cost ratio) is O ( r 2) and the existence of a deterministic O (r 4 ) -competitive algorithm is proved and r is the maximum cardinality of sets R t.

SIGACT News Online Algorithms Column 36

This column will discuss some papers in online algorithms that appeared in 2020, and has instead made a selection.



Preemptive and non-preemptive generalized min sum set cover

The linear programming relaxation and analysis are completely different from the aforementioned previous works and it is shown that any preemptive solution can be transformed into a non-preemptive one by losing a factor of 6.2 in the objective function.

On the Competitive Ratio for Online Facility Location

It is proved that the competitive ratio for Online Facility Location is Θ$(\log n}{\log\log n}) and it is shown that no randomized algorithm can achieve a competitive ratio better than Ω$(\frac{\log n}(log n)$ against an oblivious adversary even if the demands lie on a line segment.

Competitive Algorithms for Generalized k-Server in Uniform Metrics

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

  • K. NayyarS. Raghvendra
  • 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

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

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

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

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

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.