Pages that link to "Item:Q3012819"
From MaRDI portal
The following pages link to Submodular Cost Allocation Problem and Applications (Q3012819):
Displaying 7 items.
- New approximations and hardness results for submodular partitioning problems (Q2115890) (← links)
- \(\ell_p\)-norm multiway cut (Q2165036) (← links)
- Approximation algorithms for connected maximum cut and related problems (Q2304552) (← links)
- Approximation algorithms for vertex happiness (Q2326078) (← links)
- Multicommodity flows and cuts in polymatroidal networks (Q2826073) (← links)
- Sperner’s Colorings and Optimal Partitioning of the Simplex (Q4604392) (← links)
- Improved Approximation Algorithms for Inventory Problems (Q5041737) (← links)
