Generalized \(k\)-multiway cut problems
From MaRDI portal
Publication:2504075
DOI10.1007/BF02896389zbMath1100.05096OpenAlexW1973129994MaRDI QIDQ2504075
Cheng Zhao, Ji Ping Liu, Yue Jian Peng
Publication date: 22 September 2006
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02896389
Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Randomized algorithms (68W20)
Cites Work
- How easy is local search?
- Optimization, approximation, and complexity classes
- Local search and the local structure of NP-complete problems
- Rounding algorithms for a geometric embedding of minimum multiway cut
- Simple Local Search Problems that are Hard to Solve
- A new approach to the maximum-flow problem
- The Complexity of Multiterminal Cuts
- Approximation Algorithms for Some Graph Partitioning Problems
- Unnamed Item
- Unnamed Item