| Faster Goal-Oriented Shortest Path Search for Bulk and Incremental Detailed Routing
|
2022 |
Ahrens, Markus |
| Improving the Cook et al, Proximity Bound Given Integral Valued Constraints
|
2022 |
Celaya, Marcel |
| Optimal Item Pricing in Online Combinatorial Auctions
|
2022 |
Correa, José |
| On the Complexity of Separation from the Knapsack Polytope
|
2022 |
Pia, Alberto Del |
| Improved Approximations for Capacitated Vehicle Routing with Unsplittable Client Demands
|
2022 |
Friggstad, Zachary |
| Non-adaptive Stochastic Score Classification and Explainable Halfspace Evaluation
|
2022 |
Ghuge, Rohan |
| Neural Networks with Linear Threshold Activations: Structure and Algorithms
|
2022 |
Khalife, Sammy |
| 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 |
| 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 |
Tag hinzufügen