Imagen de Portada

$\{s,t\}$-Separating Principal Partition Sequence of Submodular Functions

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Bérczi, Kristóf, Chandrasekaran, Karthekeyan, Király, Tamás, Szabo, Daniel P.
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

Approximating Submodular Matroid-Constrained Partitioning
por: Bérczi, Kristóf, et al.
Publicado: (2025)

Hypergraph Connectivity Augmentation in Strongly Polynomial Time
por: Bérczi, Kristóf, et al.
Publicado: (2024)

Splitting-off in Hypergraphs
por: Bérczi, Kristóf, et al.
Publicado: (2023)

Multiway Cuts with a Choice of Representatives
por: Bérczi, Kristóf, et al.
Publicado: (2024)

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

Rainbow Arborescence Conjecture
por: Bérczi, Kristóf, et al.
Publicado: (2024)

Finding Spanning Trees with Perfect Matchings
por: Bérczi, Kristóf, et al.
Publicado: (2024)

On Deleting Vertices to Reduce Density in Graphs and Supermodular Functions
por: Chandrasekaran, Karthekeyan, et al.
Publicado: (2025)

Matroid Intersection under Minimum Rank Oracle
por: Bárász, Mihály, et al.
Publicado: (2024)

Online Disjoint Spanning Trees and Polymatroid Bases
por: Chandrasekaran, Karthekeyan, et al.
Publicado: (2025)

Above-Guarantee Algorithm for Properly Colored Spanning Trees
por: Bai, Yuhang, et al.
Publicado: (2026)

Hedgegraph Polymatroids
por: Chandrasekaran, Karthekeyan, et al.
Publicado: (2025)

Hypergraph Splitting-Off via Element-Connectivity Preserving Reductions
por: Chandrasekaran, Karthekeyan, et al.
Publicado: (2025)

Approximating maximum-size properly colored forests
por: Bai, Yuhang, et al.
Publicado: (2024)

Approximating maximum properly colored forests via degree bounded independent sets
por: Bai, Yuhang, et al.
Publicado: (2025)

Polyhedral Aspects of Feedback Vertex Set and Pseudoforest Deletion Set
por: Chandrasekaran, Karthekeyan, et al.
Publicado: (2023)

Minimum Cost Nowhere-zero Flows and Cut-balanced Orientations
por: Chandrasekaran, Karthekeyan, et al.
Publicado: (2025)

Matroid Secretary via Labeling Schemes
por: Bérczi, Kristóf, et al.
Publicado: (2024)

The NTU Partitioned Matching Game for International Kidney Exchange Programs
por: Csáji, Gergely, et al.
Publicado: (2024)

Free-order secretary for two-sided independence systems
por: Bérczi, Kristóf, et al.
Publicado: (2025)

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

Inverse matroid optimization under subset constraints
por: Bérczi, Kristóf, et al.
Publicado: (2025)

Submodular Maximization Subject to Uniform and Partition Matroids: From Theory to Practical Applications and Distributed Solutions
por: Kia, Solmaz S.
Publicado: (2025)

A new approach to bipartite stable matching optimization
por: Fleiner, Tamás, et al.
Publicado: (2024)

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

Efficient Deterministic Algorithms for Maximizing Symmetric Submodular Functions
por: Wan, Zongqi, 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)

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

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

Concentration of Submodular Functions and Read-k Families Under Negative Dependence
por: Duppala, Sharmila, et al.
Publicado: (2023)

Sparse Submodular Function Minimization
por: Graur, Andrei, et al.
Publicado: (2023)

Maximization of Approximately Submodular Functions
por: Horel, Thibaut, et al.
Publicado: (2024)

Odd and Even Harder Problems on Cycle-Factors
por: Hörsch, Florian, et al.
Publicado: (2025)

The Online Submodular Cover Problem
por: Gupta, Anupam, et al.
Publicado: (2025)

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

Submodular Order Functions and Assortment Optimization
por: Udwani, Rajan
Publicado: (2021)

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)