Cover Image

Correcting the Foundational Analysis of Karp--Vazirani--Vazirani (STOC 1990): A Rigorous Revision of the $1-1/e$ Upper Bound

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Xu, Pan
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms 05C70, 68W20, 90B80, 60J20
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Fast Monte Carlo algorithm for evaluating matrix functions with application in complex networks
by: Guidotti, Nicolas L., et al.
Published: (2023)

Fast and Slow Mixing of the Kawasaki Dynamics on Bounded-Degree Graphs
by: Kuchukova, Aiya, et al.
Published: (2024)

Asymptotic size of the Karp-Sipser Core in Configuration Model
by: Chatterjee, Arnab, et al.
Published: (2025)

Optimal Online Bipartite Matching in Degree-2 Graphs
by: Bhangale, Amey, et al.
Published: (2025)

Optimal non-adaptive algorithm for edge estimation
by: Bishnu, Arijit, et al.
Published: (2025)

The Distributional Tail of Worst-Case Quickselect
by: Płecha, Witold
Published: (2026)

Fast Dimensionality Reduction from $\ell_2$ to $\ell_p$
by: Chiclana, Rafael, et al.
Published: (2025)

Strongly Sublinear Algorithms for Testing Pattern Freeness
by: Newman, Ilan, et al.
Published: (2021)

Glauber dynamics for the hard-core model on bounded-degree $H$-free graphs
by: Jerrum, Mark
Published: (2024)

Random-Order Online Independent Set of Intervals and Hyperrectangles
by: Garg, Mohit, et al.
Published: (2024)

Fundamentals of Partial Rejection Sampling
by: Jerrum, Mark
Published: (2021)

Shortest Paths without a Map, but with an Entropic Regularizer
by: Bubeck, Sébastien, et al.
Published: (2022)

Which $L_p$ norm is the fairest? Approximations for fair facility location across all "$p$"
by: Gupta, Swati, et al.
Published: (2022)

Provably Small Portfolios for Multiobjective Optimization with Application to Subsidized Facility Location
by: Gupta, Swati, et al.
Published: (2025)

Deterministically Simulating Barely Random Algorithms in the Random-Order Arrival Model
by: Borodin, Allan, et al.
Published: (2025)

Balancing Notions of Equity: Trade-offs Between Fair Portfolio Sizes and Achievable Guarantees
by: Gupta, Swati, et al.
Published: (2023)

Stochastic Function Certification with Correlations
by: Ghuge, Rohan, et al.
Published: (2026)

PPSZ is better than you think
by: Scheder, Dominik
Published: (2022)

Covering and packing mixed-integer linear programs with a fixed number of constraints: Approximation and convex hull
by: Grobben, Kobe, et al.
Published: (2025)

The Power of Filling in Balanced Allocations
by: Los, Dimitrios, et al.
Published: (2022)

Mean-Biased Processes for Balanced Allocations
by: Los, Dimitrios, et al.
Published: (2023)

The degree-restricted random process is far from uniform
by: Molloy, Michael, et al.
Published: (2022)

A simple polynomial-time approximation algorithm for the total variation distance between two product distributions
by: Feng, Weiming, et al.
Published: (2022)

Advancing Stochastic 3-SAT Solvers by Dissipating Oversatisfied Constraints
by: Schwardt, J., et al.
Published: (2025)

Quasi-optimal hierarchically semi-separable matrix approximation
by: Amsel, Noah, et al.
Published: (2025)

Incremental-Decremental Maximization
by: Disser, Yann, et al.
Published: (2025)

A $5$-Approximation Analysis for the Cover Small Cuts Problem
by: Simmons, Miles, et al.
Published: (2026)

An asymptotically optimal algorithm for generating bin cardinalities
by: Devroye, Luc, et al.
Published: (2024)

A simple Path-based LP Relaxation for Directed Steiner Tree
by: Pashkovich, Kanstantsin, et al.
Published: (2026)

On the Average-Case Performance of Greedy for Maximum Coverage
by: Balkanski, Eric, et al.
Published: (2026)

Convergence of the QuickVal Residual
by: Fill, James Allen, et al.
Published: (2024)

Exact recovery for seeded graph matching
by: Fraiman, Nicolas, et al.
Published: (2026)

On Conjectures concerning the Labeled Coupon Collector Problem
by: Barak-Pelleg, Dina, et al.
Published: (2025)

Streaming algorithms for groups and semigroups
by: Lohrey, Markus, et al.
Published: (2022)

Improved Approximation Algorithms for Capacitated Network Design and Flexible Graph Connectivity
by: Bansal, Ishan, et al.
Published: (2024)

Additive estimates of the permanent using Gaussian fields
by: Mukerji, Tantrik, et al.
Published: (2022)

Naively Sorting Evolving Data is Optimal and Robust
by: Giakkoupis, George, et al.
Published: (2024)

Algorithms for the ferromagnetic Potts model on expanders
by: Carlson, Charlie, et al.
Published: (2022)

Fast sampling of satisfying assignments from random $k$-SAT with applications to connectivity
by: Chen, Zongchen, et al.
Published: (2022)

Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-Means
by: Friggstad, Zachary, et al.
Published: (2018)