On the generalized multiway cut in trees problem
From MaRDI portal
Connectivity (05C40) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)
Recommendations
Cited in
(9)- On weighted multiway cuts in trees
- Multi-way sparsest cut problem on trees with a control on the number of parts and outliers
- On the generalized multiway cut in trees problem
- Generalized \(k\)-multiway cut problems
- Algorithms for cut problems on trees
- FPTAS’s for Some Cut Problems in Weighted Trees
- Multi-terminal cuts in generalized tree networks
- Multi-multiway cut problem on graphs of bounded branch width
- Improved parameterized and exact algorithms for cut problems on trees
This page was built for publication: On the generalized multiway cut in trees problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3167357)