scientific article; zbMATH DE number 7533337

DOI10.4230/LIPIcs.CSL.2018.12MaRDI QIDQ5079734

Marcello Mamino, Manuel Bodirsky, Caterina Viola

Publication date: 28 May 2022

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

model theoryoptimisationconstraint satisfactionpiecewise linear functionssemilinearsubmodular functionsvalued constraint satisfaction problems

Mathematics Subject Classification ID

Logic in computer science (03B70)

Cites Work

• Unnamed Item
• Unnamed Item
• A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
• Min CSP on Four Elements: Moving beyond Submodularity
• Algebraic Properties of Valued Constraint Satisfaction Problem
• The Power of Linear Programming for General-Valued CSPs

This page was built for publication: