Imagen de Portada

Submodular Max-Min Allocation under Identical Valuations

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Boehmer, Kimon
Formato:	Preprint
Publicado:	2026
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

GIST: Greedy Independent Set Thresholding for Max-Min Diversification with Submodular Utility
por: Fahrbach, Matthew, et al.
Publicado: (2024)

Minimum Envy Graphical House Allocation Beyond Identical Valuations
por: Inamdar, Tanmay, et al.
Publicado: (2026)

Max-Min Diversification with Asymmetric Distances
por: Kumpulainen, Iiro, et al.
Publicado: (2025)

Robust Multiagent Collaboration Through Weighted Max-Min T-Joins
por: Alipour, Sharareh
Publicado: (2026)

Efficient stream-based Max-Min diversification with minimal failure rate
por: Kalogeratos, Argyris, et al.
Publicado: (2020)

Arcee: An OCM-Solver
por: Boehmer, Kimon, et al.
Publicado: (2024)

Parameterized Max Min Feedback Vertex Set
por: Lampis, Michael, et al.
Publicado: (2023)

An Approximation Algorithm for Monotone Submodular Cost Allocation
por: Mizutani, Ryuhei
Publicado: (2025)

Faster Algorithms for Fair Max-Min Diversification in $\mathbb{R}^d$
por: Kurkure, Yash, et al.
Publicado: (2024)

Min-Max Connected Multiway Cut
por: Tiwary, Hans Raj, et al.
Publicado: (2026)

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

Semi-Streaming Algorithms for Submodular Maximization under Random Arrival Order
por: Buchbinder, Niv, et al.
Publicado: (2026)

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

On the Approximability of Train Routing and the Min-Max Disjoint Paths Problem
por: Bhaskar, Umang, et al.
Publicado: (2025)

Constant Approximation for Weighted Nash Social Welfare with Submodular Valuations
por: Feng, Yuda, et al.
Publicado: (2024)

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

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

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

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

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

A Competitive Algorithm for Throughput Maximization on Identical Machines
por: Moseley, Benjamin, et al.
Publicado: (2021)

Nash Social Welfare with Submodular Valuations: Approximation Algorithms and Integrality Gaps
por: Bei, Xiaohui, et al.
Publicado: (2025)

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

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)

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

Scheduling on Identical Machines with Setup Time and Unknown Execution Time
por: Kawase, Yasushi, et al.
Publicado: (2025)

The Min Max Average Cycle Weight Problem
por: Elmalem, Noga Klein, et al.
Publicado: (2025)

Fair-Count-Min: Frequency Estimation under Equal Group-wise Approximation Factor
por: Shahbazi, Nima, et al.
Publicado: (2025)

Min-CSPs on Complete Instances II: Polylogarithmic Approximation for Min-NAE-3-SAT
por: Anand, Aditya, et al.
Publicado: (2025)

Parameterized Complexity of Submodular Minimization under Uncertainty
por: Kakimura, Naonori, et al.
Publicado: (2024)

Cycle Cancellation for Submodular Fractional Allocations and Applications
por: Chekuri, Chandra, et al.
Publicado: (2025)

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

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

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

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

iFlow: An Interactive Max-Flow/Min-Cut Algorithms Visualizer
por: Ye, Muyang, et al.
Publicado: (2024)

Submodular Maximization under Supermodular Constraint: Greedy Guarantees
por: Srivastava, Ajitesh, et al.
Publicado: (2026)

Min-Max Correlation Clustering via Neighborhood Similarity
por: Cao, Nairen, et al.
Publicado: (2025)

Approximate Min-Sum Subset Convolution
por: Stoian, Mihail
Publicado: (2024)