Image de couverture de livre

Symmetric Submodular Functions, Uncrossable Functions, and Structural Submodularity

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Simmons, Miles, Bansal, Ishan, Cheriyan, Joe
Format:	Preprint
Publié:	2025
Sujets:	Discrete Mathematics 68W25, 90C27, 05C40
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A $5$-Approximation Analysis for the Cover Small Cuts Problem
par: Simmons, Miles, et autres
Publié: (2026)

Improved Approximation Algorithms for Capacitated Network Design and Flexible Graph Connectivity
par: Bansal, Ishan, et autres
Publié: (2024)

Deterministic Algorithm and Faster Algorithm for Submodular Maximization subject to a Matroid Constraint
par: Buchbinder, Niv, et autres
Publié: (2024)

A Speed-up for Helsgaun's TSP Heuristic by Relaxing the Positive Gain Criterion
par: Ammann, Sabrina C. L., et autres
Publié: (2024)

The Generalized Double Pouring Problem: Analysis, Bounds and Algorithms
par: Jäger, Gerold, et autres
Publié: (2025)

Submodular Maximization over a Matroid $k$-Intersection: Multiplicative Improvement over Greedy
par: Feldman, Moran, et autres
Publié: (2026)

Bicriteria Submodular Maximization
par: Feldman, Moran, et autres
Publié: (2025)

Supermodular Maximization with Cardinality Constraints
par: Chen, Xujin, et autres
Publié: (2025)

Improved Integrality Gap in Max-Min Allocation: or Topology at the North Pole
par: Haxell, Penny, et autres
Publié: (2022)

A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem
par: Heimann, Sophia, et autres
Publié: (2025)

SAT-Based Search for Minwise Independent Families
par: Iurlano, Enrico, et autres
Publié: (2024)

The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$
par: Heimann, Sophia, et autres
Publié: (2024)

The Bottom-Left Algorithm for the Strip Packing Problem
par: Hougardy, Stefan, et autres
Publié: (2024)

Distributed Computing for Huge-Scale Aggregative Convex Programming
par: Tao, Luoyi
Publié: (2026)

Packing, Hitting, and Colouring Squares
par: Caoduro, Marco, et autres
Publié: (2022)

A Bad Example for Jain's Iterative Rounding Theorem for the Cover Small Cuts Problem
par: Simmons, Miles, et autres
Publié: (2025)

Revisiting Chazelle's Implementation of the Bottom-Left Heuristic: A Corrected and Rigorous Analysis
par: Michel, Stefan
Publié: (2025)

An Improved Drift Theorem for Balanced Allocations
par: Los, Dimitrios, et autres
Publié: (2023)

Minimizing Maximum Dissatisfaction in the Allocation of Indivisible Items under a Common Preference Graph
par: Chiarelli, Nina, et autres
Publié: (2023)

A Fast 3-Approximation for the Capacitated Tree Cover Problem with Edge Loads
par: Rockel-Wolff, Benjamin
Publié: (2024)

A simple Path-based LP Relaxation for Directed Steiner Tree
par: Pashkovich, Kanstantsin, et autres
Publié: (2026)

The Parity-Constrained Four-Peg Tower of Hanoi Problem and Its Associated Graph
par: Mehiri, El-Mehdi
Publié: (2025)

A Menger-type theorem for two induced paths
par: Albrechtsen, Sandra, et autres
Publié: (2023)

Weighted domination models and randomized heuristics
par: Dijkstra, Lukas, et autres
Publié: (2022)

Fundamentals of Partial Rejection Sampling
par: Jerrum, Mark
Publié: (2021)

Symmetric Rule-Based Achlioptas Processes for Random $k$-SAT
par: Chatterjee, Arnab
Publié: (2025)

W-state graphs: Structure and Algorithms
par: Gajjala, Rishikesh, et autres
Publié: (2026)

Symmetric properties and two variants of shuffle-cubes
par: Lü, Huazhong, et autres
Publié: (2021)

Distributed Computing for Huge-Scale Linear Programming
par: Tao, Luoyi
Publié: (2024)

Optimal Hardness of Online Algorithms for Large Independent Sets
par: Gamarnik, David, et autres
Publié: (2025)

The Güler-type acceleration for proximal gradient, linearized augmented Lagrangian and linearized alternating direction method of multipliers
par: Zhou, Bin, et autres
Publié: (2025)

The Power of Filling in Balanced Allocations
par: Los, Dimitrios, et autres
Publié: (2022)

Mean-Biased Processes for Balanced Allocations
par: Los, Dimitrios, et autres
Publié: (2023)

On the boundedness of the sequence generated by minibatch stochastic gradient descent
par: Bauschke, Heinz H., et autres
Publié: (2025)

Thresholds of Queen covers
par: Adhikari, Tirthankar, et autres
Publié: (2025)

Young domination on Hamming rectangles
par: Gravner, Janko, et autres
Publié: (2025)

New Formulation for Coloring Circle Graphs and its Application to Capacitated Stowage Stack Minimization
par: Tanaka, Masato, et autres
Publié: (2021)

Incremental-Decremental Maximization
par: Disser, Yann, et autres
Publié: (2025)

Enumeration Kernels of Polynomial Size for Cuts of Bounded Degree
par: Komusiewicz, Christian, et autres
Publié: (2023)

Signed double Roman domination on cubic graphs
par: Iurlano, Enrico, et autres
Publié: (2023)