Simple and Fast Rounding Algorithms for Directed and Node-weighted Multiway Cut
From MaRDI portal
Publication:4575636
DOI10.1137/1.9781611974331.ch57zbMath1410.05197arXiv1507.04674OpenAlexW2951073764MaRDI QIDQ4575636
Publication date: 16 July 2018
Published in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.04674
Programming involving graphs or networks (90C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (3)
Global and fixed-terminal cuts in digraphs ⋮ Hypergraph Cuts with General Splitting Functions ⋮ Vertex downgrading to minimize connectivity
This page was built for publication: Simple and Fast Rounding Algorithms for Directed and Node-weighted Multiway Cut
