Beyond JWP: a tractable class of binary VCSPs via M-convex intersection
From MaRDI portal
Recommendations
Cites work
- A geometric study of the split decomposition
- A tractable class of binary VCSPs via M-convex intersection
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Convexity and Steinitz's exchange property
- Discrete convex analysis
- Discrete Convex Analysis
- Discrete convexity and polynomial solvability in minimum 0-extension problems
- Discrete convexity in joint winner property
- Hybrid tractability of valued constraint problems
- Hybrid tractable classes of constraint problems
- Matrices and matroids for systems analysis
- Recent developments in discrete convex analysis
- The complexity of general-valued CSPs
- The complexity of valued constraint satisfaction problems
- The power of linear programming for general-valued CSPs
- Tractable Optimization Problems through Hypergraph-Based Structural Restrictions
- Tractable triangles and cross-free convexity in discrete optimisation
- Valuated Matroid Intersection I: Optimality Criteria
- Valuated Matroid Intersection II: Algorithms
- Valuated matroids
- Valuated matroids: A new look at the greedy algorithm
Cited in
(3)
This page was built for publication: Beyond JWP: a tractable class of binary VCSPs via M-convex intersection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3304138)
