Submodular minimization under congruency constraints

DOI10.1007/s00493-019-3900-1zbMath1463.90178arXiv1707.06212OpenAlexW2982598954WikidataQ114229225 ScholiaQ114229225MaRDI QIDQ2300162

Rico Zenklusen, Martin Nägele, Benjamin Sudakov

Publication date: 26 February 2020

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1707.06212

zbMATH Keywords

combinatoricsminimizationsubmodular function minimizationcongruency constraints

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Nonlinear programming (90C30) Combinatorics in computer science (68R05) Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (8)

Notes on \(\{a,b,c\}\)-modular matrices ⋮ Turán numbers of sunflowers ⋮ On Lattice Width of Lattice-Free Polyhedra and Height of Hilbert Bases ⋮ Advances on strictly \(\varDelta \)-modular IPs ⋮ A new contraction technique with applications to congruency-constrained cuts ⋮ On the recognition of \(\{a,b,c\}\)-modular matrices ⋮ Constraint Satisfaction Problems with Global Modular Constraints: Algorithms and Hardness via Polynomial Representations ⋮ The integrality number of an integer program

This page was built for publication: Submodular minimization under congruency constraints