Approximation Algorithms for Submodular Multiway Partition
From MaRDI portal
Publication:5495000
DOI10.1109/FOCS.2011.34zbMath1292.68163MaRDI QIDQ5495000
Publication date: 30 July 2014
Published in: 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (Search for Journal in Brave)
Related Items (12)
Improved Approximation Algorithms for Inventory Problems ⋮ Constrained Submodular Maximization via a Nonsymmetric Technique ⋮ An \(O^\ast(1.84^k)\) parameterized algorithm for the multiterminal cut problem ⋮ Mixed-case community detection problem in social networks: algorithms and analysis ⋮ Hypergraph \(k\)-cut in randomized polynomial time ⋮ Submodular Cost Allocation Problem and Applications ⋮ Computing minimum multiway cuts in hypergraphs ⋮ Posimodular function optimization ⋮ Multicommodity flows and cuts in polymatroidal networks ⋮ Approximation algorithms for vertex happiness ⋮ Hypergraph k-Cut for Fixed k in Deterministic Polynomial Time ⋮ New approximations and hardness results for submodular partitioning problems
This page was built for publication: Approximation Algorithms for Submodular Multiway Partition
