| 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 |
| 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 |
| 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