On the generalized multiway cut in trees problem
From MaRDI portal
Publication:2436662
DOI10.1007/s10878-012-9565-9zbMath1286.90158OpenAlexW1965919218MaRDI QIDQ2436662
Publication date: 25 February 2014
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-012-9565-9
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (2)
Improved parameterized and exact algorithms for cut problems on trees ⋮ Combinatorial approximation algorithms for the submodular multicut problem in trees with submodular penalties
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An approximation algorithm for the generalized \(k\)-multicut problem
- Multicut in trees viewed through the eyes of vertex cover
- Primal-dual approximation algorithms for integral flow and multicut in trees
- Simple and improved parameterized algorithms for multiterminal cuts
- A general method to speed up fixed-parameter-tractable algorithms
- An improved parameterized algorithm for the minimum node multiway cut problem
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
- Rounding algorithms for a geometric embedding of minimum multiway cut
- Detecting high log-densities
- On the Generalized Multiway Cut in Trees Problem
- Fixed-parameter tractability and data reduction for multicut in trees
- Multiway cut and integer flow problems in trees
- On the multiway cut polyhedron
- The Complexity of Multiterminal Cuts
- A POLYNOMIAL KERNEL FOR MULTICUT IN TREES
- Multicut is FPT
- Approximating Generalized Multicut on Trees
This page was built for publication: On the generalized multiway cut in trees problem
