| 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 |
| 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 |
| Sparse Multi-term Disjunctive Cuts for the Epigraph of a Function of Binary Variables
|
2022 |
Chen, Rui |
| A Constant-Factor Approximation for Generalized Malleable Scheduling Under M 4 -Concave Processing Speeds
|
2022 |
Fotakis, Dimitris |
| On the Complexity of Finding Shortest Variable Disjunction Branch-and-Bound Proofs
|
2022 |
Gläser, Max |
| A PTAS for the Horizontal Rectangle Stabbing Problem
|
2022 |
Khan, Arindam |
| The Secretary Problem with Distributions
|
2022 |
Nuti, Pranav |
| Graph Coloring and Semidefinite Rank
|
2022 |
Smedira, Renee Mirka. Devin |
| Faster Goal-Oriented Shortest Path Search for Bulk and Incremental Detailed Routing
|
2022 |
Ahrens, Markus |
Tag hinzufügen