Image de couverture de livre

Covering and packing mixed-integer linear programs with a fixed number of constraints: Approximation and convex hull

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Grobben, Kobe, Moura, Phablo F. S., Yaman, Hande
Format:	Preprint
Publié:	2025
Sujets:	Data Structures and Algorithms 68W25, 68W40, 90Cxx
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)

Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-Means
par: Friggstad, Zachary, et autres
Publié: (2018)

On the connected (sub)partition polytope
par: Moura, Phablo F. S., et autres
Publié: (2024)

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

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

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

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

Improved Approximation Algorithms for the Expanding Search Problem
par: Griesbach, Svenja M., et autres
Publié: (2023)

The Telephone $k$-Multicast Problem
par: Hathcock, Daniel, et autres
Publié: (2024)

Cardinality-Constrained Continuous Knapsack Problem with Concave Piecewise-Linear Utilities
par: Bai, Miao, et autres
Publié: (2023)

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

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

Balanced connected partitions of edge-weighted graphs: Hardness and solving methods
par: Davari, Morteza, et autres
Publié: (2025)

Loss Minimization for Electrical Flows over Spanning Trees on Grids
par: Ito, Takehiro, et autres
Publié: (2024)

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

Improved Randomized Approximation of Hard Universality and Emptiness Problems
par: Andreou, Pantelis, et autres
Publié: (2024)

Building a Nest by an Automaton
par: Czyzowicz, Jurek, et autres
Publié: (2019)

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

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

Quasi-optimal hierarchically semi-separable matrix approximation
par: Amsel, Noah, et autres
Publié: (2025)

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

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

Which $L_p$ norm is the fairest? Approximations for fair facility location across all "$p$"
par: Gupta, Swati, et autres
Publié: (2022)

Computing and Enumerating Minimal Common Supersequences Between Two Strings
par: Sopp, Braeden, et autres
Publié: (2026)

Compact formulations and valid inequalities for parallel machine scheduling with conflicts
par: Moura, Phablo F. S., et autres
Publié: (2023)

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

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

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

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

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

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

Optimal Online Bipartite Matching in Degree-2 Graphs
par: Bhangale, Amey, et autres
Publié: (2025)

Improved Regret Guarantees for Online Mirror Descent using a Portfolio of Mirror Maps
par: Gupta, Swati, et autres
Publié: (2026)

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

Incremental-Decremental Maximization
par: Disser, Yann, 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)

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

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