| On the Maximal Number of Columns of a A-modular Matrix
|
2022 |
Averkov, Gennadiy |
| The Simultaneous Semi-random Model for TSP
|
2022 |
Balkanski, Eric |
| A Simple LP-Based Approximation Algorithm for the Matching Augmentation Problem
|
2022 |
Bamas, Étienne |
| A Simple Method for Convex Optimization in the Oracle Model
|
2022 |
Dadush, Daniel |
| Simple Odd ß-Cycle Inequalities for Binary Polynomial Optimization
|
2022 |
Pia, Alberto Del |
| Intersecting and Dense Restrictions of Clutters in Polynomial Time
|
2022 |
Drees, Martin |
| SOCP-Based Disjunctive Cuts for a Class of Integer Nonlinear Bilevel Programs
|
2022 |
Gaar, Elisabeth |
| The Two-Stripe Symmetric Circulant TSP is in P
|
2022 |
Gutekunst, Samuel C. |
| Matroid-Based TSP Rounding for Half-Integral Solutions
|
2022 |
Gupta, Anupam |
| The Limits of Local Search for Weighted k-Set Packing
|
2022 |
Neuwohner, Meike |
| Approximate CVP in Time 2°.802n - Now in Any Norm!
|
2022 |
Rothvoss, Thomas |
| Total Dual Dyadicness and Dyadic Generating Sets
|
2022 |
Abdi, Ahmad |
| A 2-Approximation for the Bounded Treewidth Sparsest Cut Problem in FPT Time
|
2022 |
Cohen-Addad, Vincent |
| On Circuit Diameter Bounds via Circuit Imbalances
|
2022 |
Dadush, Daniel |
| LP-Based Approximations for Disjoint Bilinear and Two-Stage Adjustable Robust Optimization
|
2022 |
Housni, Omar El |
| An Abstract Model for Branch-and-Cut
|
2022 |
Kazachkov, Aleksandr M. |
| Lattice-Free Simplices with Lattice Width 2d — o(d)
|
2022 |
Mayrhofer, Lukas |
| A Competitive Algorithm for Throughput Maximization on Identical Machines
|
2022 |
Moseley, Benjamin |
| Combinatorial Algorithms for Rooted Prize-Collecting Walks and Applications to Orienteering and Minimum-Latency Problems
|
2022 |
Dezfuli, Sina |
| Faster Connectivity in Low-Rank Hypergraphs via Expander Decomposition
|
2022 |
Beideman, Calvin |
Tag hinzufügen