Pages that link to "Item:Q5326597"
From MaRDI portal
The following pages link to The Power of Linear Programming for Finite-Valued CSPs: A Constructive Characterization (Q5326597):
Displaying 6 items.
- Towards a characterization of constant-factor approximable finite-valued CSPs (Q1671996) (← links)
- Half-integrality, LP-branching, and FPT algorithms (Q2816829) (← links)
- The Complexity of Finite-Valued CSPs (Q3177814) (← links)
- Necessary Conditions for Tractability of Valued CSPs (Q3455247) (← links)
- Piecewise Linear Valued CSPs Solvable by Linear Programming Relaxation (Q5056366) (← links)
- Discrete convexity and polynomial solvability in minimum 0-extension problems (Q5962712) (← links)