Sparse Approximation in Lattices and Semigroups

Kuhlmann S, Oertel T, Weismantel R (2025)

Publication Type: Conference contribution

Publication year: 2025

Journal

Lecture Notes in Computer Science Springer Verlag

Publisher: Springer Science and Business Media Deutschland GmbH

Book Volume: 15620 LNCS

Pages Range: 371-384

Conference Proceedings Title: Lecture Notes in Computer Science

Event location: Baltimore, MD, USA

ISBN: 9783031931116

DOI: 10.1007/978-3-031-93112-3_27

Abstract

Given an integer or a non-negative integer solution x to a system Ax=b, where the number of non-zero components of x is at most n. This paper addresses the following question: How closely can we approximate b with Ay, where y is an integer or non-negative integer solution constrained to have at most k non-zero components with k

Authors with CRIS profile

Timm Oertel Professur für Mathematische Analyse von Daten (Data Analytics)

Involved external institutions

Eidgenössische Technische Hochschule Zürich (ETHZ) / Swiss Federal Institute of Technology in Zurich CH Switzerland (CH)

How to cite

APA:

Kuhlmann, S., Oertel, T., & Weismantel, R. (2025). Sparse Approximation in Lattices and Semigroups. In Nicole Megow, Amitabh Basu (Eds.), Lecture Notes in Computer Science (pp. 371-384). Baltimore, MD, USA: Springer Science and Business Media Deutschland GmbH.

MLA:

Kuhlmann, Stefan, Timm Oertel, and Robert Weismantel. "Sparse Approximation in Lattices and Semigroups." Proceedings of the 26th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2025, Baltimore, MD, USA Ed. Nicole Megow, Amitabh Basu, Springer Science and Business Media Deutschland GmbH, 2025. 371-384.

BibTeX: Download