Derives a new computable performance bound for greedy schemes in string optimization that generalizes and improves on Conforti and Cornuéjols α_G and α_G'' bounds while providing a counterexample for α_G'.
An online algorithm for maximizing submodular functions,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
eess.SY 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Performance Bound for the Greedy Algorithm in a Generalized Class of String Optimization Problems
Derives a new computable performance bound for greedy schemes in string optimization that generalizes and improves on Conforti and Cornuéjols α_G and α_G'' bounds while providing a counterexample for α_G'.