Image de couverture de livre

Submodular Maximization over a Matroid $k$-Intersection: Multiplicative Improvement over Greedy

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Feldman, Moran, Ward, Justin
Format:	Preprint
Publié:	2026
Sujets:	Data Structures and Algorithms Discrete Mathematics 90C27 (Primary) 68W25, 68W20, 68Q25 (Secondary) F.2.2; G.2.1
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

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

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

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)

On the PLS-Completeness of $k$-Opt Local Search for the Traveling Salesman Problem
par: Heimann, Sophia, et autres
Publié: (2026)

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

Extending Exact Integrality Gap Computations for the Metric TSP
par: Cook, William, et autres
Publié: (2026)

A 13/6-Approximation for Strip Packing via the Bottom-Left Algorithm
par: Hougardy, Stefan, et autres
Publié: (2025)

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

How to Compute a Moving Sum
par: Maslen, David K., et autres
Publié: (2025)

On the Approximation Ratio of the $k$-Opt and Lin-Kernighan Algorithm
par: Zhong, Xianghui
Publié: (2019)

Extending the Extension: Deterministic Algorithm for Non-monotone Submodular Maximization
par: Buchbinder, Niv, et autres
Publié: (2024)

On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
par: DasGupta, Bhaskar, et autres
Publié: (2026)

Fast sampling of satisfying assignments from random $k$-SAT with applications to connectivity
par: Chen, Zongchen, et autres
Publié: (2022)

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

Separating Coverage and Submodular: Maximization Subject to a Cardinality Constraint
par: Filmus, Yuval, et autres
Publié: (2024)

A note on the parameter $\ell$ in Buchbinder--Feldman's deterministic submodular matroid algorithm
par: Li, Shisheng
Publié: (2026)

Shortest Paths without a Map, but with an Entropic Regularizer
par: Bubeck, Sébastien, et autres
Publié: (2022)

A Constant Factor Approximation for Directed Feedback Vertex Set in Graphs of Bounded Genus
par: Sun, Hao
Publié: (2023)

On (In)approximability of MaxMin Independent Set Reconfiguration
par: Hoang, Hung P., et autres
Publié: (2026)

On the Average-Case Performance of Greedy for Maximum Coverage
par: Balkanski, Eric, et autres
Publié: (2026)

Exact Set Packing in Multimodal Transportation with Ridesharing System for First/Last Mile
par: Gu, Qian-Ping, et autres
Publié: (2025)

Fairness in the k-Server Problem
par: Daneshvaramoli, Mohammadreza, et autres
Publié: (2025)

Searching in trees with monotonic query times
par: Dereniowski, Dariusz, et autres
Publié: (2024)

Nearly Tight Sample Complexity for Matroid Online Contention Resolution
par: Feldman, Moran, et autres
Publié: (2025)

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

An Explicit and Efficient $O(n^2)$-Time Algorithm for Sorting Sumsets
par: Mundhra, S.
Publié: (2025)

New Theoretical Insights and Algorithmic Solutions for Reconstructing Score Sequences from Tournament Score Sets
par: Liu, Bowen
Publié: (2025)

Achieving Tight $O(4^k)$ Runtime Bounds on Jump$_k$ by Proving that Genetic Algorithms Evolve Near-Maximal Population Diversity
par: Opris, Andre, et autres
Publié: (2024)

Pliability and Approximating Max-CSPs
par: Romero, Miguel, et autres
Publié: (2019)

Tighter Approximation for the Uniform Cost-Distance Steiner Tree Problem
par: Foos, Josefine, et autres
Publié: (2023)

APTAS for bin packing with general cost structures
par: Jaykrishnan, G., et autres
Publié: (2024)

Handling LP-Rounding for Hierarchical Clustering and Fitting Distances by Ultrametrics
par: An, Hyung-Chan, et autres
Publié: (2025)

Strongly Sublinear Algorithms for Testing Pattern Freeness
par: Newman, Ilan, et autres
Publié: (2021)

Random-Order Online Independent Set of Intervals and Hyperrectangles
par: Garg, Mohit, et autres
Publié: (2024)

Many Objective Problems Where Crossover is Provably Essential
par: Opris, Andre
Publié: (2024)

Optimal non-adaptive algorithm for edge estimation
par: Bishnu, Arijit, et autres
Publié: (2025)

Covering and packing mixed-integer linear programs with a fixed number of constraints: Approximation and convex hull
par: Grobben, Kobe, et autres
Publié: (2025)

Algorithms for Generating Small Random Samples
par: Cicirello, Vincent A.
Publié: (2024)

Exact Dynamic Programming for Solow--Polasky Diversity Subset Selection on Lines and Staircases
par: Emmerich, Michael T. M.
Publié: (2026)