Sparsification of Two-Variable Valued Constraint Satisfaction Problems

Abstract

A valued constraint satisfaction problem (VCSP) instance (V,Π, w) is a set of variables V with a set of constraints Π weighted by w. Given a VCSP instance, we are interested in a reweighted subinstance (V,Π′ ⊂ Π, w′) that preserves the value of the given instance (under every assignment to the variables) within factor 1 ± . A well-studied special case is… (More)
DOI: 10.1137/15M1046186

Topics

2 Figures and Tables

Slides referencing similar topics