Pages that link to "Item:Q2225054"
From MaRDI portal
The following pages link to Improving proximity bounds using sparsity (Q2225054):
Displaying 9 items.
- Tightness of sensitivity and proximity bounds for integer linear programs (Q831833) (← links)
- An FPTAS for the \(\varDelta \)-modular multidimensional knapsack problem (Q2117618) (← links)
- On lattice point counting in \(\varDelta\)-modular polyhedra (Q2162684) (← links)
- Improving the Cook et al. proximity bound given integral valued constraints (Q2164682) (← links)
- Sparse Sourcewise and Pairwise Distance Preservers (Q3440267) (← links)
- Distance-Sparsity Transference for Vertices of Corner Polyhedra (Q5147026) (← links)
- A colorful Steinitz lemma with application to block-structured integer programs (Q6120853) (← links)
- On \(\Delta\)-modular integer linear problems in the canonical form and equivalent problems (Q6200377) (← links)
- Faster algorithms for sparse ILP and hypergraph multi-packing/multi-cover problems (Q6593834) (← links)