Publisher
Springer Nature Switzerland
Reference33 articles.
1. Aliev, I., De Loera, J.A., Oertel, T., O’Neill, C.: Sparse solutions of linear Diophantine equations. SIAM J. Appl. Algebra Geom. 1(1), 239–253 (2017)
2. Bansal, N., Oosterwijk, T., Vredeveld, T., van der Zwaan, R.: Approximating vector scheduling: almost matching upper and lower bounds. Algorithmica 76(4), 1077–1096 (2016). https://doi.org/10.1007/s00453-016-0116-0
3. Bolyai Society Mathematical Studies;I Bárány,2008
4. Berndt, S., Brinkop, H., Jansen, K., Mnich, M., Stamm, T.: New support size bounds for integer programming, applied to makespan minimization on uniformly related machines. In: Proceedings of ISAAC 2023 (2023). https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2023.13
5. Berndt, S., Jansen, K., Klein, K.M.: New bounds for the vertices of the integer hull. In: Proceedings of SOSA 2021, pp. 25–36 (2021)