A 4.509-approximation algorithm for generalized min-sum set cover that improves the prior 4.642 bound via refined LP analysis and new lower-tail bounds on sums of independent Bernoullis.
Improved approximations for min sum vertex cover and generalized min sum set cover
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2representative citing papers
Global Bradley-Terry rankings of LLMs are misleading due to structured heterogeneity in user preferences, and small (λ, ν)-portfolios recover coherent subpopulations that cover over 96% of votes with just five rankings.
citing papers explorer
-
A 4.509-Approximation Algorithm for Generalized Min Sum Set Cover
A 4.509-approximation algorithm for generalized min-sum set cover that improves the prior 4.642 bound via refined LP analysis and new lower-tail bounds on sums of independent Bernoullis.
-
Why Global LLM Leaderboards Are Misleading: Small Portfolios for Heterogeneous Supervised ML
Global Bradley-Terry rankings of LLMs are misleading due to structured heterogeneity in user preferences, and small (λ, ν)-portfolios recover coherent subpopulations that cover over 96% of votes with just five rankings.