Pages that link to "Item:Q3012819"
From MaRDI portal
The following pages link to Submodular Cost Allocation Problem and Applications (Q3012819):
Displaying 11 items.
- Application of M-convex submodular flow problem to mathematical economics (Q1433504) (← links)
- 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)
- Divide-and-conquer algorithms for partitioning hypergraphs and submodular systems (Q2428700) (← links)
- Multicommodity flows and cuts in polymatroidal networks (Q2826073) (← links)
- Hardness of submodular cost allocation: lattice matching and a simplex coloring conjecture (Q2969615) (← links)
- Sperner’s Colorings and Optimal Partitioning of the Simplex (Q4604392) (← links)
- Utility Design for Distributed Resource Allocation—Part II: Applications to Submodular, Covering, and Supermodular Problems (Q5034057) (← links)
- Improved Approximation Algorithms for Inventory Problems (Q5041737) (← links)