Pages that link to "Item:Q5495000"
From MaRDI portal
The following pages link to Approximation Algorithms for Submodular Multiway Partition (Q5495000):
Displaying 12 items.
- Computing minimum multiway cuts in hypergraphs (Q1799394) (← links)
- New approximations and hardness results for submodular partitioning problems (Q2115890) (← links)
- Mixed-case community detection problem in social networks: algorithms and analysis (Q2220864) (← links)
- Hypergraph \(k\)-cut in randomized polynomial time (Q2227530) (← links)
- Approximation algorithms for vertex happiness (Q2326078) (← links)
- An \(O^\ast(1.84^k)\) parameterized algorithm for the multiterminal cut problem (Q2445900) (← links)
- Multicommodity flows and cuts in polymatroidal networks (Q2826073) (← links)
- Submodular Cost Allocation Problem and Applications (Q3012819) (← links)
- Improved Approximation Algorithms for Inventory Problems (Q5041737) (← links)
- Constrained Submodular Maximization via a Nonsymmetric Technique (Q5108227) (← links)
- Hypergraph <i>k</i>-Cut for Fixed <i>k</i> in Deterministic Polynomial Time (Q5870380) (← links)
- Posimodular function optimization (Q5918641) (← links)
