Pages that link to "Item:Q5741731"
From MaRDI portal
The following pages link to Local Distribution and the Symmetry Gap: Approximability of Multiway Partitioning Problems (Q5741731):
Displaying 14 items.
- Graph cuts with interacting edge weights: examples, approximations, and algorithms (Q517305) (← links)
- Towards a characterization of constant-factor approximable finite-valued CSPs (Q1671996) (← links)
- New approximations and hardness results for submodular partitioning problems (Q2115890) (← links)
- A tight \(\sqrt{2} \)-approximation for linear 3-cut (Q2205984) (← links)
- Approximation algorithms for vertex happiness (Q2326078) (← links)
- Sherali-Adams Relaxations for Valued CSPs (Q3448860) (← links)
- Sperner’s Colorings and Optimal Partitioning of the Simplex (Q4604392) (← links)
- Improved Approximation Algorithms for Inventory Problems (Q5041737) (← links)
- (Q5091252) (← links)
- The Power of Linear Programming for General-Valued CSPs (Q5252658) (← links)
- The Complexity of General-Valued CSPs (Q5283238) (← links)
- The Power of Sherali--Adams Relaxations for General-Valued CSPs (Q5348454) (← links)
- Hypergraph <i>k</i>-Cut for Fixed <i>k</i> in Deterministic Polynomial Time (Q5870380) (← links)
- The Limitations of Optimization from Samples (Q5889795) (← links)