Tighter bounds on (1+1/ℓ)^{-ℓ} via the Pólya–Szegő inequality and an alternating-series expansion for log(1+t) allow setting ℓ ≈ 1/(2eε) instead of 1/ε, improving the implicit constant in the algorithm's query complexity.
Nemhauser and Laurence A
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
A note on the parameter $\ell$ in Buchbinder--Feldman's deterministic submodular matroid algorithm
Tighter bounds on (1+1/ℓ)^{-ℓ} via the Pólya–Szegő inequality and an alternating-series expansion for log(1+t) allow setting ℓ ≈ 1/(2eε) instead of 1/ε, improving the implicit constant in the algorithm's query complexity.