Pages that link to "Item:Q2357129"
From MaRDI portal
The following pages link to The computational complexity of three graph problems for instances with bounded minors of constraint matrices (Q2357129):
Displaying 5 items.
- FPT-algorithms for some problems related to integer programming (Q1752617) (← links)
- An FPTAS for the \(\varDelta \)-modular multidimensional knapsack problem (Q2117618) (← links)
- On lattice point counting in \(\varDelta\)-modular polyhedra (Q2162684) (← links)
- FPT-algorithm for computing the width of a simplex given by a convex hull (Q2314204) (← links)
- On \(\Delta\)-modular integer linear problems in the canonical form and equivalent problems (Q6200377) (← links)
