8 citations · 10 across the 6 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
math.OC2026
Matroid-Aware Spectral Certificates for Multiplicative Coverage Approximation
Navid Rezazadeh
We maximize the weight of edges covered by selected vertices, together with nonnegative individual rewards, under an arbitrary matroid constraint. The continuous coverage objective…
math.OC2026
Covariance-Rank Rounding and a Sharp Integrality Gap for a Matroid Edge-Coverage Moment Lift
Navid Rezazadeh
Selecting vertices covers their incident edges, but a matroid can prevent selecting the combinations that cover the most weight. We study whether pair-selection information improve…