A Constructive FPT Algorithm for Integer Cone Optimization with Convex Costs
cs.DS
Submitted: 2026-09-25
Updated: 2026-11-03
Terminology
Sources
- Multiple-choice Vector Bin Packing: Arc-flow Formulation with Graph Compression
- Structural Results for High-Multiplicity Scheduling on Uniform Machines
- Multitype Integer Monoid Optimization and Applications
Related papers
- PHastR: Faster Minimal Perfect Hashing with Rotated Layouts
- Fine-Grained Complexity of Approximating Vector Knapsack: A Faster Algorithm and Equivalence with k-SUM in 2D
- Polynomial-time computation of p-contraction fixed points for even p
- Separations Between Submodular-Like Graph Widths
- Bounded Integer Programming in Almost N 2d Time
- Fast Odd-Permutation Sums in Characteristic Two and Shortest Even Directed Cycles