Imagen de Portada

A note on the parameter $\ell$ in Buchbinder--Feldman's deterministic submodular matroid algorithm

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Li, Shisheng
Formato:	Preprint
Publicado:	2026
Materias:	Data Structures and Algorithms 68W25, 90C27 F.2.2; G.2.1
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Extending Exact Integrality Gap Computations for the Metric TSP
por: Cook, William, et al.
Publicado: (2026)

On the PLS-Completeness of $k$-Opt Local Search for the Traveling Salesman Problem
por: Heimann, Sophia, et al.
Publicado: (2026)

The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$
por: Heimann, Sophia, et al.
Publicado: (2024)

A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem
por: Heimann, Sophia, et al.
Publicado: (2025)

Approximation algorithms for the prize-collecting rural postman problem
por: Li, Hong, et al.
Publicado: (2026)

The Bottom-Left Algorithm for the Strip Packing Problem
por: Hougardy, Stefan, et al.
Publicado: (2024)

Deterministic Algorithm and Faster Algorithm for Submodular Maximization subject to a Matroid Constraint
por: Buchbinder, Niv, et al.
Publicado: (2024)

Tighter Approximation for the Uniform Cost-Distance Steiner Tree Problem
por: Foos, Josefine, et al.
Publicado: (2023)

Submodular Maximization over a Matroid $k$-Intersection: Multiplicative Improvement over Greedy
por: Feldman, Moran, et al.
Publicado: (2026)

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

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

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

On (In)approximability of MaxMin Independent Set Reconfiguration
por: Hoang, Hung P., et al.
Publicado: (2026)

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

An improved approximation algorithm for k-Median
por: Young, Neal E.
Publicado: (2025)

Bicriteria Submodular Maximization
por: Feldman, Moran, et al.
Publicado: (2025)

Cluster Before You Hallucinate: Approximating Node-Capacitated Network Design and Energy Efficient Routing
por: Krishnaswamy, Ravishankar, et al.
Publicado: (2014)

How to Compute a Moving Sum
por: Maslen, David K., et al.
Publicado: (2025)

Traffic-Oblivious Multi-Commodity Flow Network Design
por: Chimani, Markus, et al.
Publicado: (2025)

Approximating Graphic Multi-Path TSP and Graphic Ordered TSP
por: Alimi, Morteza, et al.
Publicado: (2025)

Handling LP-Rounding for Hierarchical Clustering and Fitting Distances by Ultrametrics
por: An, Hyung-Chan, et al.
Publicado: (2025)

Separating Coverage and Submodular: Maximization Subject to a Cardinality Constraint
por: Filmus, Yuval, et al.
Publicado: (2024)

On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
por: DasGupta, Bhaskar, et al.
Publicado: (2026)

Modern column generation for estimating single- and multi-purchase ranked list choice models
por: Costa, Luciano, et al.
Publicado: (2026)

On the Average-Case Performance of Greedy for Maximum Coverage
por: Balkanski, Eric, et al.
Publicado: (2026)

ARRIVAL: Recursive Framework & $\ell_1$-Contraction
por: Haslebacher, Sebastian
Publicado: (2025)

Searching in trees with monotonic query times
por: Dereniowski, Dariusz, et al.
Publicado: (2024)

Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics
por: Chimani, Markus, et al.
Publicado: (2021)

Fairness in the k-Server Problem
por: Daneshvaramoli, Mohammadreza, et al.
Publicado: (2025)

Optimal non-adaptive algorithm for edge estimation
por: Bishnu, Arijit, et al.
Publicado: (2025)

Fast sampling of satisfying assignments from random $k$-SAT with applications to connectivity
por: Chen, Zongchen, et al.
Publicado: (2022)

Incremental-Decremental Maximization
por: Disser, Yann, et al.
Publicado: (2025)

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

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

A $5$-Approximation Analysis for the Cover Small Cuts Problem
por: Simmons, Miles, et al.
Publicado: (2026)

Improved Approximation Algorithms for Capacitated Network Design and Flexible Graph Connectivity
por: Bansal, Ishan, et al.
Publicado: (2024)

On the twin-width of near-regular graphs
por: Heinrich, Irene, et al.
Publicado: (2025)

On the Integrality Gap of Directed Steiner Tree LPs with Relatively Integral Solutions
por: Laekhanukit, Bundit
Publicado: (2024)

Improved Approximations for Stationary Bipartite Matching: Beyond Probabilistic Independence
por: AmaniHamedani, Alireza, et al.
Publicado: (2024)

How quickly can you pack short paths? Engineering a search-tree algorithm for disjoint s-t paths of bounded length
por: Huber, Michael Kiran
Publicado: (2024)