Pages that link to "Item:Q5252658"
From MaRDI portal
The following pages link to The Power of Linear Programming for General-Valued CSPs (Q5252658):
Displaying 39 items.
- Edge bipartization faster than \(2^k\) (Q666655) (← links)
- On a general framework for network representability in discrete optimization (Q1631628) (← links)
- A compact representation for minimizers of \(k\)-submodular functions (Q1631630) (← links)
- Towards a characterization of constant-factor approximable finite-valued CSPs (Q1671996) (← links)
- Computing DM-decomposition of a partitioned matrix with rank-1 blocks (Q1747895) (← links)
- L-extendable functions and a proximity scaling algorithm for minimum cost multiflow problem (Q1751126) (← links)
- A compact representation for modular semilattices and its applications (Q2006979) (← links)
- Minimum 0-extension problems on directed metrics (Q2042078) (← links)
- Piecewise linear valued constraint satisfaction problems with fixed number of variables (Q2056915) (← links)
- Minimizing submodular functions on diamonds via generalized fractional matroid matchings (Q2171023) (← links)
- Using a Min-Cut generalisation to go beyond Boolean surjective VCSPs (Q2211354) (← links)
- On planar valued CSPs (Q2396724) (← links)
- On $k$-Submodular Relaxation (Q2820856) (← links)
- On a General Framework for Network Representability in Discrete Optimization (Q2835692) (← links)
- A Compact Representation for Minimizers of k-Submodular Functions (Extended Abstract) (Q2835693) (← links)
- Beyond JWP: A Tractable Class of Binary VCSPs via M-Convex Intersection. (Q3304138) (← links)
- A Galois Connection for Valued Constraint Languages of Infinite Size (Q3448812) (← links)
- Sherali-Adams Relaxations for Valued CSPs (Q3448860) (← links)
- Necessary Conditions for Tractability of Valued CSPs (Q3455247) (← links)
- (Q4568111) (← links)
- Discrete Convex Functions on Graphs and Their Algorithmic Applications (Q4689627) (← links)
- A Tractable Class of Binary VCSPs via M-Convex Intersection (Q4972691) (← links)
- (Q4993594) (← links)
- Hybrid Tractable Classes of Constraint Problems (Q4993597) (← links)
- The Complexity of Valued CSPs (Q4993602) (← links)
- (Q5079734) (← links)
- (Q5089214) (← links)
- (Q5089260) (← links)
- (Q5090503) (← links)
- Testing the Complexity of a Valued CSP Language (Q5091236) (← links)
- Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs (Q5203794) (← links)
- Solving LP Relaxations of Some NP-Hard Problems Is As Hard As Solving Any Linear Program (Q5231683) (← links)
- The Complexity of General-Valued CSPs (Q5283238) (← links)
- The Power of Sherali--Adams Relaxations for General-Valued CSPs (Q5348454) (← links)
- Binarisation for Valued Constraint Satisfaction Problems (Q5371026) (← links)
- Gauges, loops, and polynomials for partition functions of graphical models (Q5857453) (← links)
- CLAP: A New Algorithm for Promise CSPs (Q5885595) (← links)
- Discrete convexity and polynomial solvability in minimum 0-extension problems (Q5962712) (← links)
- Super-reparametrizations of weighted CSPs: properties and optimization perspective (Q6049436) (← links)
