Extending the Extension: Deterministic Algorithm for Non-monotone Submodular Maximization

Documenti analoghi

• Deterministic Algorithm and Faster Algorithm for Submodular Maximization subject to a Matroid Constraint
  di: Buchbinder, Niv, et al.
  Pubblicazione: (2024)
• Submodular Maximization over a Matroid $k$-Intersection: Multiplicative Improvement over Greedy
  di: Feldman, Moran, et al.
  Pubblicazione: (2026)
• Bicriteria Submodular Maximization
  di: Feldman, Moran, et al.
  Pubblicazione: (2025)
• An Explicit and Efficient $O(n^2)$-Time Algorithm for Sorting Sumsets
  di: Mundhra, S.
  Pubblicazione: (2025)
• Probabilistic Analysis of Edge Elimination for Euclidean TSP
  di: Zhong, Xianghui
  Pubblicazione: (2018)