Formulates coordinate subset and partition selection for ergodic multivariate Markov chains as submodular problems and supplies greedy algorithms with approximation guarantees plus a generalized distorted greedy variant.
Submodular maximization over multiple matroids via generalized exchange properties.Mathematics of Operations Research, 35(4):795–806
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.PR 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Information-theoretic coordinate subset and partition selection of multivariate Markov chains via submodular optimization
Formulates coordinate subset and partition selection for ergodic multivariate Markov chains as submodular problems and supplies greedy algorithms with approximation guarantees plus a generalized distorted greedy variant.