Parameterized algorithms for block-structured integer programs with large entries
Fuente:
arXiv
Saved in:
| Main Authors: | Cslovjecsek, Jana, Koutecký, Martin, Lassota, Alexandra, Pilipczuk, Michał, Polak, Adam |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs
by: Hunkenschröder, Christoph, et al.
Published: (2025)
by: Hunkenschröder, Christoph, et al.
Published: (2025)
Parameterized Complexity of Scheduling Problems in Robotic Process Automation
by: Dvořák, Michal, et al.
Published: (2026)
by: Dvořák, Michal, et al.
Published: (2026)
A First Order Method for Linear Programming Parameterized by Circuit Imbalance
by: Cole, Richard, et al.
Published: (2023)
by: Cole, Richard, et al.
Published: (2023)
On Integer Programs That Look Like Paths
by: Briański, Marcin, et al.
Published: (2025)
by: Briański, Marcin, et al.
Published: (2025)
Parameterized and approximation algorithms for coverings points with segments in the plane
by: Kowalska, Katarzyna, et al.
Published: (2024)
by: Kowalska, Katarzyna, et al.
Published: (2024)
Parameterized dynamic data structure for Split Completion
by: Majewski, Konrad, et al.
Published: (2024)
by: Majewski, Konrad, et al.
Published: (2024)
Accelerated first-order methods for a class of semidefinite programs
by: Wang, Alex L., et al.
Published: (2022)
by: Wang, Alex L., et al.
Published: (2022)
A nearly optimal randomized algorithm for explorable heap selection
by: Borst, Sander, et al.
Published: (2022)
by: Borst, Sander, et al.
Published: (2022)
A rounding and clustering-based exact algorithm for the p-center problem
by: Ales, Zacharie, et al.
Published: (2024)
by: Ales, Zacharie, et al.
Published: (2024)
Computational complexity of the recoverable robust shortest path problem in acyclic digraphs
by: Kasperski, Adam, et al.
Published: (2024)
by: Kasperski, Adam, et al.
Published: (2024)
Generalized Assignment and Knapsack Problems in the Random-Order Model
by: Klimm, Max, et al.
Published: (2025)
by: Klimm, Max, et al.
Published: (2025)
Integer programs with nearly totally unimodular matrices: the cographic case
by: Aprile, Manuel, et al.
Published: (2024)
by: Aprile, Manuel, et al.
Published: (2024)
A note on the complexity of the picker routing problem in multi-block warehouses and related problems
by: Prunet, Thibault, et al.
Published: (2023)
by: Prunet, Thibault, et al.
Published: (2023)
Optimization of Next-Day Delivery Coverage using Constraint Programming and Random Key Optimizers
by: Brubaker, Kyle, et al.
Published: (2025)
by: Brubaker, Kyle, et al.
Published: (2025)
Quantum speedups for linear programming via interior point methods
by: Apers, Simon, et al.
Published: (2023)
by: Apers, Simon, et al.
Published: (2023)
A quantum central path algorithm for linear optimization
by: Augustino, Brandon, et al.
Published: (2023)
by: Augustino, Brandon, et al.
Published: (2023)
Labeling Methods for Partially Ordered Paths
by: Euler, Ricardo, et al.
Published: (2023)
by: Euler, Ricardo, et al.
Published: (2023)
Sparse Submodular Function Minimization
by: Graur, Andrei, et al.
Published: (2023)
by: Graur, Andrei, et al.
Published: (2023)
Acceleration by Stepsize Hedging I: Multi-Step Descent and the Silver Stepsize Schedule
by: Altschuler, Jason M., et al.
Published: (2023)
by: Altschuler, Jason M., et al.
Published: (2023)
Dynamic Pricing for Reusable Resources: The Power of Two Prices
by: Balseiro, Santiago R., et al.
Published: (2023)
by: Balseiro, Santiago R., et al.
Published: (2023)
Continuous Non-monotone DR-submodular Maximization with Down-closed Convex Constraint
by: Chen, Shengminjie, et al.
Published: (2023)
by: Chen, Shengminjie, et al.
Published: (2023)
Dynamic Batching of Online Arrivals to Leverage Economies of Scale
by: Bhimaraju, Akhil, et al.
Published: (2023)
by: Bhimaraju, Akhil, et al.
Published: (2023)
Entropy Regularization and Faster Decremental Matching in General Graphs
by: Chen, Jiale, et al.
Published: (2023)
by: Chen, Jiale, et al.
Published: (2023)
When Location Shapes Choice: Placement Optimization of Substitutable Products
by: Housni, Omar El, et al.
Published: (2023)
by: Housni, Omar El, et al.
Published: (2023)
Radial Isotropic Position via an Implicit Newton's Method
by: Jambulapati, Arun, et al.
Published: (2025)
by: Jambulapati, Arun, et al.
Published: (2025)
An Optimal Algorithm for the Stacker Crane Problem on Fixed Topologies
by: Chen, Yike, et al.
Published: (2024)
by: Chen, Yike, et al.
Published: (2024)
Balancing Gradient and Hessian Queries in Non-Convex Optimization
by: Adil, Deeksha, et al.
Published: (2025)
by: Adil, Deeksha, et al.
Published: (2025)
Deriving the Gradients of Some Popular Optimal Transport Algorithms
by: Xie, Fangzhou
Published: (2025)
by: Xie, Fangzhou
Published: (2025)
Coordinating Spot and Contract Supply in Freight Marketplaces
by: Kaminsky, Philip, et al.
Published: (2026)
by: Kaminsky, Philip, et al.
Published: (2026)
Scalable First-Order Interior Point Trust Region Algorithms for Linearly Constrained Optimization
by: Su, Yuexin, et al.
Published: (2026)
by: Su, Yuexin, et al.
Published: (2026)
On Approximation of Robust Max-Cut and Related Problems using Randomized Rounding Algorithms
by: Shi, Haoyan, et al.
Published: (2024)
by: Shi, Haoyan, et al.
Published: (2024)
On contention resolution for the hypergraph matching, knapsack, and $k$-column sparse packing problems
by: Sergeev, Ivan
Published: (2024)
by: Sergeev, Ivan
Published: (2024)
Distributionally Robust Newsvendor on a Metric
by: Foussoul, Ayoub, et al.
Published: (2024)
by: Foussoul, Ayoub, et al.
Published: (2024)
ALNS for Tugboat Scheduling in Inland Waterway
by: Ma, Zihang
Published: (2025)
by: Ma, Zihang
Published: (2025)
The Robust Bilevel Selection Problem
by: Henke, Dorothee
Published: (2024)
by: Henke, Dorothee
Published: (2024)
A Faster Parametric Search for the Integral Quickest Transshipment Problem
by: Anapolska, Mariia, et al.
Published: (2025)
by: Anapolska, Mariia, et al.
Published: (2025)
Approximating $q \rightarrow p$ Norms of Non-Negative Matrices in Nearly-Linear Time
by: Objois, Étienne, et al.
Published: (2025)
by: Objois, Étienne, et al.
Published: (2025)
Extracting Dual Solutions via Primal Optimizers
by: Carmon, Yair, et al.
Published: (2024)
by: Carmon, Yair, et al.
Published: (2024)
On the complexity of the upgrading version of the maximal covering location problem
by: Baldomero-Naranjo, Marta, et al.
Published: (2024)
by: Baldomero-Naranjo, Marta, et al.
Published: (2024)
An Efficient Frequency-Based Approach for Maximal Square Detection in Binary Matrices
by: Bhandari, Swastik
Published: (2025)
by: Bhandari, Swastik
Published: (2025)
Similar Items
-
(Near)-Optimal Algorithms for Sparse Separable Convex Integer Programs
by: Hunkenschröder, Christoph, et al.
Published: (2025) -
Parameterized Complexity of Scheduling Problems in Robotic Process Automation
by: Dvořák, Michal, et al.
Published: (2026) -
A First Order Method for Linear Programming Parameterized by Circuit Imbalance
by: Cole, Richard, et al.
Published: (2023) -
On Integer Programs That Look Like Paths
by: Briański, Marcin, et al.
Published: (2025) -
Parameterized and approximation algorithms for coverings points with segments in the plane
by: Kowalska, Katarzyna, et al.
Published: (2024)