1: Lattice Sparsification and the Approximate Closest Vector Problem
2: An Exact Algorithm for TSP in Degree-3 Graphs via Circuit Procedure and Amortization on Connectivity Structure
3: Maximizing a Nonnegative, Monotone, Submodular Function Constrained to Matchings
4: Maximum Balanced Subgraph Problem Parameterized Above Lower Bound