Imagen de Portada

The Online Submodular Cover Problem

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Gupta, Anupam, Levin, Roie
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Fully-Dynamic Submodular Cover with Bounded Recourse
por: Gupta, Anupam, et al.
Publicado: (2020)

Random Order Set Cover is as Easy as Offline
por: Gupta, Anupam, et al.
Publicado: (2021)

Pairwise-Independent Contention Resolution
por: Gupta, Anupam, et al.
Publicado: (2024)

The Online Submodular Assignment Problem
por: Hathcock, Daniel, et al.
Publicado: (2024)

The Online Submodular Assignment Problem
por: Hathcock, Daniel, et al.
Publicado: (2024)

A Learning Perspective on Random-Order Covering Problems
por: Gupta, Anupam, et al.
Publicado: (2025)

Competitively Consistent Clustering
por: Buchbinder, Niv, et al.
Publicado: (2025)

Chasing Positive Bodies
por: Bhattacharya, Sayan, et al.
Publicado: (2023)

The Submodular Santa Claus Problem
por: Bamas, Etienne, et al.
Publicado: (2024)

A Dynamic Algorithm for Weighted Submodular Cover Problem
por: Banihashem, Kiarash, et al.
Publicado: (2024)

Fast Stochastic Greedy Algorithm for $k$-Submodular Cover Problem
por: Nguyen, Hue T., et al.
Publicado: (2025)

Bicriteria Algorithms for Submodular Cover with Partition and Fairness Constraints
por: Chen, Wenjing, et al.
Publicado: (2026)

Learning-Augmented Online Covering Problems
por: Ameli, Afrouz Jabal, et al.
Publicado: (2025)

A Tight Competitive Ratio for Online Submodular Welfare Maximization
por: Ganz, Amit, et al.
Publicado: (2023)

Steiner Forest: A Simplified Better-Than-2 Approximation
por: Gupta, Anupam, et al.
Publicado: (2025)

Optimality of Non-Adaptive Algorithms in Online Submodular Welfare Maximization with Stochastic Outcomes
por: Udwani, Rajan
Publicado: (2024)

Minimum Cost Adaptive Submodular Cover
por: Al-Thani, Hessa, et al.
Publicado: (2022)

Chasing Submodular Objectives, and Submodular Maximization via Cutting Planes
por: Buchbinder, Niv, et al.
Publicado: (2025)

Online Two-Stage Submodular Maximization
por: Nikolaou, Iasonas, et al.
Publicado: (2025)

Trading Prophets with Initial Capital
por: Azar, Yossi, et al.
Publicado: (2025)

Competitive Bundle Trading
por: Azar, Yossi, et al.
Publicado: (2025)

Improved Online Hitting Set Algorithms for Structured and Geometric Set Systems
por: Bhore, Sujoy, et al.
Publicado: (2026)

An Exact Solver for Submodular Knapsack Problems
por: Münch, Sabine, et al.
Publicado: (2025)

Fair Submodular Cover
por: Chen, Wenjing, et al.
Publicado: (2024)

Monotone Submodular Multiway Partition
por: Bi, Richard, et al.
Publicado: (2024)

Submodular Maximization in Exactly $n$ Queries
por: Balkanski, Eric, et al.
Publicado: (2024)

Learning-Augmented Dynamic Submodular Maximization
por: Agarwal, Arpit, et al.
Publicado: (2023)

A Poisson Process for Submodular Maximization
por: Rozenman, Amit Ganz, et al.
Publicado: (2026)

Regularized Unconstrained Weakly Submodular Maximization
por: Zhu, Yanhui, et al.
Publicado: (2024)

$\{s,t\}$-Separating Principal Partition Sequence of Submodular Functions
por: Bérczi, Kristóf, et al.
Publicado: (2025)

Improved Algorithms for Fair Matroid Submodular Maximization
por: Mahabadi, Sepideh, et al.
Publicado: (2026)

Cut Sparsification and Succinct Representation of Submodular Hypergraphs
por: Kenneth, Yotam, et al.
Publicado: (2023)

Prize-Collecting Forest with Submodular Penalties: Improved Approximation
por: Ahmadi, Ali, et al.
Publicado: (2025)

Fair Submodular Maximization over a Knapsack Constraint
por: Li, Lijun, et al.
Publicado: (2025)

Subquadratic Submodular Maximization with a General Matroid Constraint
por: Kobayashi, Yusuke, et al.
Publicado: (2024)

Submodular Max-Min Allocation under Identical Valuations
por: Boehmer, Kimon
Publicado: (2026)

Improved Evolutionary Algorithms for Submodular Maximization with Cost Constraints
por: Zhu, Yanhui, et al.
Publicado: (2024)

Efficient Deterministic Algorithms for Maximizing Symmetric Submodular Functions
por: Wan, Zongqi, et al.
Publicado: (2024)

Fast Parallel Algorithms for Submodular $p$-Superseparable Maximization
por: Cervenjak, Philip, et al.
Publicado: (2023)

A Threshold Greedy Algorithm for Noisy Submodular Maximization
por: Chen, Wenjing, et al.
Publicado: (2023)