Imagen de Portada

Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Amanatidis, Georgios, Fusco, Federico, Lazos, Philip, Leonardi, Stefano, Reiffenhäuser, Rebecca
Formato:	Preprint
Publicado:	2020
Materias:	Data Structures and Algorithms Machine Learning
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Submodular Maximization subject to a Knapsack Constraint: Combinatorial Algorithms with Near-optimal Adaptive Complexity
por: Amanatidis, Georgios, et al.
Publicado: (2021)

Algorithmically Fair Maximization of Multiple Submodular Objective Functions
por: Amanatidis, Georgios, et al.
Publicado: (2024)

Deletion Robust Non-Monotone Submodular Maximization over Matroids
por: Dütting, Paul, et al.
Publicado: (2022)

Efficient Two-Sided Markets with Limited Information
por: Dütting, Paul, et al.
Publicado: (2020)

Practical and Parallelizable Algorithms for Non-Monotone Submodular Maximization with Size Constraint
por: Chen, Yixin, et al.
Publicado: (2020)

Consistent Submodular Maximization
por: Dütting, Paul, et al.
Publicado: (2024)

Practical Parallel Algorithms for Non-Monotone Submodular Maximization
por: Cui, Shuang, et al.
Publicado: (2023)

Deletion Robust Submodular Maximization over Matroids
por: Dütting, Paul, et al.
Publicado: (2022)

Fully Dynamic Submodular Maximization over Matroids
por: Dütting, Paul, et al.
Publicado: (2023)

Fairness in Streaming Submodular Maximization over a Matroid Constraint
por: Halabi, Marwa El, et al.
Publicado: (2023)

The Cost of Consistency: Submodular Maximization with Constant Recourse
por: Dütting, Paul, et al.
Publicado: (2024)

Pandora's Box Problem with Order Constraints
por: Boodaghians, Shant, et al.
Publicado: (2020)

Pandora's Box Problem With Time Constraints
por: Amanatidis, Georgios, et al.
Publicado: (2024)

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

Truthful Matching with Online Items and Offline Agents
por: Feldman, Michal, et al.
Publicado: (2022)

Practical $0.385$-Approximation for Submodular Maximization Subject to a Cardinality Constraint
por: Tukan, Murad, et al.
Publicado: (2024)

Efficient Branch-and-Bound for Submodular Function Maximization under Knapsack Constraint
por: Hao, Yimin, et al.
Publicado: (2025)

Single-Sample Prophet Inequalities via Greedy-Ordered Selection
por: Caramanis, Constantine, et al.
Publicado: (2021)

Online Learning in the Random Order Model
por: Bernasconi, Martino, et al.
Publicado: (2025)

Linear Submodular Maximization with Bandit Feedback
por: Chen, Wenjing, et al.
Publicado: (2024)

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

A Note On Deterministic Submodular Maximization With Bounded Curvature
por: Li, Wenxin
Publicado: (2024)

Deterministic Algorithm for Non-monotone Submodular Maximization under Matroid and Knapsack Constraints
por: Chen, Shengminjie, et al.
Publicado: (2026)

Maximizing a Submodular Function with Bounded Curvature under an Unknown Knapsack Constraint
por: Klimm, Max, et al.
Publicado: (2022)

The Power of Second Chance: Personalized Submodular Maximization with Two Candidates
por: Yuan, Jing, et al.
Publicado: (2024)

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

Best of Both Worlds: Practical and Theoretically Optimal Submodular Maximization in Parallel
por: Chen, Yixin, et al.
Publicado: (2021)

Mini-batch Submodular Maximization
por: Schwartzman, Gregory
Publicado: (2024)

Enhanced Deterministic Approximation Algorithm for Non-monotone Submodular Maximization under Knapsack Constraint with Linear Query Complexity
por: Pham, Canh V.
Publicado: (2024)

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

Fairness in Monotone $k$-submodular Maximization: Algorithms and Applications
por: Zhu, Yanhui, et al.
Publicado: (2024)

Repeated Bilateral Trade Against a Smoothed Adversary
por: Cesa-Bianchi, Nicolò, et al.
Publicado: (2023)

The Role of Transparency in Repeated First-Price Auctions with Unknown Valuations
por: Cesa-Bianchi, Nicolò, et al.
Publicado: (2023)

High-dimensional Linear Bandits with Knapsacks
por: Ma, Wanteng, et al.
Publicado: (2023)

Submodular Ground-Set Pruning: Monotone Tightness and a Non-Monotone Separation
por: Kuhnle, Alan
Publicado: (2026)

Scalable Fair Influence Blocking Maximization via Approximately Monotonic Submodular Optimization
por: Fang, Qiangpeng, et al.
Publicado: (2026)

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

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

Discretely Beyond $1/e$: Guided Combinatorial Algorithms for Submodular Maximization
por: Chen, Yixin, et al.
Publicado: (2024)

MNL-Bandit with Knapsacks: a near-optimal algorithm
por: Aznag, Abdellah, et al.
Publicado: (2021)