Cover Image

Sparse Approximation in Lattices and Semigroups

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kuhlmann, Stefan, Oertel, Timm, Weismantel, Robert
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control Discrete Mathematics Combinatorics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A Threshold Phenomenon for the Shortest Lattice Vector Problem in the Infinity Norm
by: Kuhlmann, Stefan, et al.
Published: (2025)

On Rank-Monotone Graph Operations and Minimal Obstruction Graphs for the Lovász--Schrijver SDP Hierarchy
by: Au, Yu Hin, et al.
Published: (2024)

Bond Polytope under Vertex- and Edge-sums
by: Kolman, Petr, et al.
Published: (2026)

Stable Set Polytopes with High Lift-and-Project Ranks for the Lovász-Schrijver SDP Operator
by: Au, Yu Hin, et al.
Published: (2023)

On Connections Between Association Schemes and Analyses of Polyhedral and Positive Semidefinite Lift-and-Project Relaxations
by: Au, Yu Hin, et al.
Published: (2020)

On Circuit Diameter Bounds via Circuit Imbalances
by: Dadush, Daniel, et al.
Published: (2021)

Valid Cuts for the Design of Potential-based Flow Networks
by: Börner, Pascal, et al.
Published: (2025)

Approximate Graph Colouring and the Crystal with a Hollow Shadow
by: Ciardo, Lorenzo, et al.
Published: (2022)

Conformally rigid graphs
by: Steinerberger, Stefan, et al.
Published: (2024)

Polytopes of alternating sign matrices with dihedral-subgroup symmetry
by: Madarasi, Péter
Published: (2026)

An Explicit Formula for Vertex Enumeration in the CUT(n) Polytope via Probabilistic Methods
by: Marić, Nevena
Published: (2025)

Totally $Δ$-modular IPs with two non-zeros in most rows
by: Kober, Stefan
Published: (2024)

Integer programs with nearly totally unimodular matrices: the cographic case
by: Aprile, Manuel, et al.
Published: (2024)

Integer programs with bounded subdeterminants and two nonzeros per row
by: Fiorini, Samuel, et al.
Published: (2021)

Total Matching and Subdeterminants
by: Ferrarini, Luca, et al.
Published: (2023)

Gromov's Approximating Tree and the All-Pairs Bottleneck Paths Problem
by: Cornect, Anders, et al.
Published: (2024)

Diffusion-Robust Optimization over Graphs
by: Aolaritei, Liviu, et al.
Published: (2026)

Arithmetic Circuits and Neural Networks for Regular Matroids
by: Hertrich, Christoph, et al.
Published: (2025)

Cluster Assignment in Multi-Agent Systems
by: Sharf, Miel, et al.
Published: (2022)

On Matrices over a Polynomial Ring with Restricted Subdeterminants
by: Celaya, Marcel, et al.
Published: (2023)

Complexity of polytope diameters via perfect matchings
by: Nöbel, Christian, et al.
Published: (2024)

Vertex-ordering and arc-partitioning problems
by: Borsik, Nóra A., et al.
Published: (2025)

Max-Min and 1-Bounded Space Algorithms for the Bin Packing Problem
by: Fujiwara, Hiroshi, et al.
Published: (2025)

Fair Schedules for Single Round Robin Tournaments with Ranked Participants
by: Wessel, Sten, et al.
Published: (2025)

Separable convex optimization over indegree polytopes
by: Borsik, Nóra A., et al.
Published: (2025)

Prefix-bounded matrices
by: Borsik, Nóra A., et al.
Published: (2025)

On the Congruency-Constrained Matroid Base
by: Liu, Siyue, et al.
Published: (2023)

Hierarchical threshold structure in Max-Cut with geometric edge weights
by: Marić, Nevena
Published: (2026)

Asymptotic Bounds and Online Algorithms for Average-Case Matrix Discrepancy
by: Kunisky, Dmitriy, et al.
Published: (2024)

An SDP Relaxation for the Sparse Integer Least Squares Problem
by: Del Pia, Alberto, et al.
Published: (2022)

Efficient Sparse Flow Decomposition Methods for RNA Multi-Assembly
by: Besançon, Mathieu
Published: (2025)

Recommend-to-Match with Random Supply Rejections: Formulation, Approximation, and Analysis
by: Liu, Haoyue, et al.
Published: (2025)

Neural Networks and (Virtual) Extended Formulations
by: Hertrich, Christoph, et al.
Published: (2024)

On complete classes of valuated matroids
by: Husić, Edin, et al.
Published: (2021)

Efficient approximation schemes for scheduling on a stochastic number of machines
by: Epstein, Leah, et al.
Published: (2024)

Algorithmic aspects of semistability of quiver representations
by: Iwamasa, Yuni, et al.
Published: (2024)

NPA Hierarchy for Quantum Isomorphism and Homomorphism Indistinguishability
by: Kar, Prem Nigam, et al.
Published: (2024)

Decomposition Polyhedra of Piecewise Linear Functions
by: Brandenburg, Marie-Charlotte, et al.
Published: (2024)

A Θ(m^9) ternary minimum-cost network flow LP model of the Assignment Problem polytope with applications to hard combinatorial optimization problems
by: Diaby, Moustapha
Published: (2016)

Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability
by: Roberson, David E., et al.
Published: (2023)