Pages that link to "Item:Q5138974"
From MaRDI portal
The following pages link to Near-Linear Time Algorithm for $n$-Fold ILPs via Color Coding (Q5138974):
Displaying 11 items.
- Tightness of sensitivity and proximity bounds for integer linear programs (Q831833) (← links)
- Algorithms for hierarchical and semi-partitioned parallel scheduling (Q2037194) (← links)
- Empowering the configuration-IP: new PTAS results for scheduling with setup times (Q2089776) (← links)
- About the complexity of two-stage stochastic IPs (Q2118129) (← links)
- Block-structured integer programming: can we parameterize without the largest coefficient? (Q2684049) (← links)
- The double exponential runtime is tight for 2-stage stochastic ILPs (Q5918430) (← links)
- The double exponential runtime is tight for 2-stage stochastic ILPs (Q5925653) (← links)
- High-multiplicity \(N\)-fold IP via configuration LP (Q6044979) (← links)
- Complexity of Scheduling Few Types of Jobs on Related and Unrelated Machines (Q6065415) (← links)
- FPT algorithms for a special block-structured integer program with applications in scheduling (Q6634532) (← links)
- Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming (Q6634533) (← links)