Monotone Submodular Multiway Partition
Fuente:
arXiv
Saved in:
| Main Authors: | Bi, Richard, Chandrasekaran, Karthekeyan, Joshi, Soham |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
$\{s,t\}$-Separating Principal Partition Sequence of Submodular Functions
by: Bérczi, Kristóf, et al.
Published: (2025)
by: Bérczi, Kristóf, et al.
Published: (2025)
Approximating Submodular Matroid-Constrained Partitioning
by: Bérczi, Kristóf, et al.
Published: (2025)
by: Bérczi, Kristóf, et al.
Published: (2025)
Online Disjoint Spanning Trees and Polymatroid Bases
by: Chandrasekaran, Karthekeyan, et al.
Published: (2025)
by: Chandrasekaran, Karthekeyan, et al.
Published: (2025)
On Deleting Vertices to Reduce Density in Graphs and Supermodular Functions
by: Chandrasekaran, Karthekeyan, et al.
Published: (2025)
by: Chandrasekaran, Karthekeyan, et al.
Published: (2025)
Hedgegraph Polymatroids
by: Chandrasekaran, Karthekeyan, et al.
Published: (2025)
by: Chandrasekaran, Karthekeyan, et al.
Published: (2025)
Hypergraph Splitting-Off via Element-Connectivity Preserving Reductions
by: Chandrasekaran, Karthekeyan, et al.
Published: (2025)
by: Chandrasekaran, Karthekeyan, et al.
Published: (2025)
Polyhedral Aspects of Feedback Vertex Set and Pseudoforest Deletion Set
by: Chandrasekaran, Karthekeyan, et al.
Published: (2023)
by: Chandrasekaran, Karthekeyan, et al.
Published: (2023)
Minimum Cost Nowhere-zero Flows and Cut-balanced Orientations
by: Chandrasekaran, Karthekeyan, et al.
Published: (2025)
by: Chandrasekaran, Karthekeyan, et al.
Published: (2025)
Submodular Ground-Set Pruning: Monotone Tightness and a Non-Monotone Separation
by: Kuhnle, Alan
Published: (2026)
by: Kuhnle, Alan
Published: (2026)
Hypergraph Connectivity Augmentation in Strongly Polynomial Time
by: Bérczi, Kristóf, et al.
Published: (2024)
by: Bérczi, Kristóf, et al.
Published: (2024)
Splitting-off in Hypergraphs
by: Bérczi, Kristóf, et al.
Published: (2023)
by: Bérczi, Kristóf, et al.
Published: (2023)
Bicriteria Algorithms for Submodular Cover with Partition and Fairness Constraints
by: Chen, Wenjing, et al.
Published: (2026)
by: Chen, Wenjing, et al.
Published: (2026)
Scalable Fair Influence Blocking Maximization via Approximately Monotonic Submodular Optimization
by: Fang, Qiangpeng, et al.
Published: (2026)
by: Fang, Qiangpeng, et al.
Published: (2026)
Multiway Cuts with a Choice of Representatives
by: Bérczi, Kristóf, et al.
Published: (2024)
by: Bérczi, Kristóf, et al.
Published: (2024)
An Approximation Algorithm for Monotone Submodular Cost Allocation
by: Mizutani, Ryuhei
Published: (2025)
by: Mizutani, Ryuhei
Published: (2025)
Practical Parallel Algorithms for Non-Monotone Submodular Maximization
by: Cui, Shuang, et al.
Published: (2023)
by: Cui, Shuang, et al.
Published: (2023)
Deletion Robust Non-Monotone Submodular Maximization over Matroids
by: Dütting, Paul, et al.
Published: (2022)
by: Dütting, Paul, et al.
Published: (2022)
Submodular Maximization Subject to Uniform and Partition Matroids: From Theory to Practical Applications and Distributed Solutions
by: Kia, Solmaz S.
Published: (2025)
by: Kia, Solmaz S.
Published: (2025)
Practical and Parallelizable Algorithms for Non-Monotone Submodular Maximization with Size Constraint
by: Chen, Yixin, et al.
Published: (2020)
by: Chen, Yixin, et al.
Published: (2020)
Multi-Way Co-Ranking: Index-Space Partitioning of Sorted Sequences Without Merge
by: Joshi, Amit
Published: (2025)
by: Joshi, Amit
Published: (2025)
Fast Adaptive Non-Monotone Submodular Maximization Subject to a Knapsack Constraint
by: Amanatidis, Georgios, et al.
Published: (2020)
by: Amanatidis, Georgios, et al.
Published: (2020)
Chasing Submodular Objectives, and Submodular Maximization via Cutting Planes
by: Buchbinder, Niv, et al.
Published: (2025)
by: Buchbinder, Niv, et al.
Published: (2025)
Improved Approximation Algorithms for Multiway Cut by Large Mixtures of New and Old Rounding Schemes
by: Brakensiek, Joshua, et al.
Published: (2026)
by: Brakensiek, Joshua, et al.
Published: (2026)
The Online Submodular Assignment Problem
by: Hathcock, Daniel, et al.
Published: (2024)
by: Hathcock, Daniel, et al.
Published: (2024)
The Submodular Santa Claus Problem
by: Bamas, Etienne, et al.
Published: (2024)
by: Bamas, Etienne, et al.
Published: (2024)
The Online Submodular Assignment Problem
by: Hathcock, Daniel, et al.
Published: (2024)
by: Hathcock, Daniel, et al.
Published: (2024)
The Online Submodular Cover Problem
by: Gupta, Anupam, et al.
Published: (2025)
by: Gupta, Anupam, et al.
Published: (2025)
Edge Multiway Cut and Node Multiway Cut are NP-complete on subcubic graphs
by: Johnson, Matthew, et al.
Published: (2022)
by: Johnson, Matthew, et al.
Published: (2022)
Min-Max Connected Multiway Cut
by: Tiwary, Hans Raj, et al.
Published: (2026)
by: Tiwary, Hans Raj, et al.
Published: (2026)
Submodular Maximization in Exactly $n$ Queries
by: Balkanski, Eric, et al.
Published: (2024)
by: Balkanski, Eric, et al.
Published: (2024)
Regularized Unconstrained Weakly Submodular Maximization
by: Zhu, Yanhui, et al.
Published: (2024)
by: Zhu, Yanhui, et al.
Published: (2024)
Learning-Augmented Dynamic Submodular Maximization
by: Agarwal, Arpit, et al.
Published: (2023)
by: Agarwal, Arpit, et al.
Published: (2023)
A Poisson Process for Submodular Maximization
by: Rozenman, Amit Ganz, et al.
Published: (2026)
by: Rozenman, Amit Ganz, et al.
Published: (2026)
Improved Algorithms for Fair Matroid Submodular Maximization
by: Mahabadi, Sepideh, et al.
Published: (2026)
by: Mahabadi, Sepideh, et al.
Published: (2026)
Cut Sparsification and Succinct Representation of Submodular Hypergraphs
by: Kenneth, Yotam, et al.
Published: (2023)
by: Kenneth, Yotam, et al.
Published: (2023)
Fully-Dynamic Submodular Cover with Bounded Recourse
by: Gupta, Anupam, et al.
Published: (2020)
by: Gupta, Anupam, et al.
Published: (2020)
Planar Multiway Cut with Terminals on Few Faces
by: Pandey, Sukanya, et al.
Published: (2025)
by: Pandey, Sukanya, et al.
Published: (2025)
Subquadratic Submodular Maximization with a General Matroid Constraint
by: Kobayashi, Yusuke, et al.
Published: (2024)
by: Kobayashi, Yusuke, et al.
Published: (2024)
Improved Evolutionary Algorithms for Submodular Maximization with Cost Constraints
by: Zhu, Yanhui, et al.
Published: (2024)
by: Zhu, Yanhui, et al.
Published: (2024)
Efficient Deterministic Algorithms for Maximizing Symmetric Submodular Functions
by: Wan, Zongqi, et al.
Published: (2024)
by: Wan, Zongqi, et al.
Published: (2024)
Similar Items
-
$\{s,t\}$-Separating Principal Partition Sequence of Submodular Functions
by: Bérczi, Kristóf, et al.
Published: (2025) -
Approximating Submodular Matroid-Constrained Partitioning
by: Bérczi, Kristóf, et al.
Published: (2025) -
Online Disjoint Spanning Trees and Polymatroid Bases
by: Chandrasekaran, Karthekeyan, et al.
Published: (2025) -
On Deleting Vertices to Reduce Density in Graphs and Supermodular Functions
by: Chandrasekaran, Karthekeyan, et al.
Published: (2025) -
Hedgegraph Polymatroids
by: Chandrasekaran, Karthekeyan, et al.
Published: (2025)