6 citations · 6 across the 4 of their papers we have counts for
4 papers
Constant-Competitiveness for Random Assignment Matroid Secretary Without Knowing the Matroid
Richard Santiago, Ivan Sergeev, Rico Zenklusen
The Matroid Secretary Conjecture is a notorious open problem in online optimization. It claims the existence of an -competitive algorithm for the Matroid Secretary Problem (M…
Simple Random Order Contention Resolution for Graphic Matroids with Almost no Prior Information
Richard Santiago, Ivan Sergeev, Rico Zenklusen
Random order online contention resolution schemes (ROCRS) are structured online rounding algorithms with numerous applications and links to other well-known online selection proble…
Improved approximation algorithms for two Euclidean k-Center variants
Haris Angelidakis, Ivan Sergeev, Pontus Westermark
The -Center problem is one of the most popular clustering problems. After decades of work, the complexity of most of its variants on general metrics is now well understood. Surp…
Generalizations of -dimensional diagonal quantum channels with constant Frobenius norm
Ivan Sergeev
We introduce the set of quantum channels with constant Frobenius norm, the set of diagonal channels and the notion of equivalence of one-parameter families of channels. First, we s…