An improved parameterized algorithm for the multicut problem
From MaRDI portal
Publication:3014297
zbMATH Open1240.68115MaRDI QIDQ3014297FDOQ3014297
Authors: Yunlong Liu, Jianxin Wang, Jianer Chen 
Publication date: 19 July 2011
Recommendations
- Simple and improved parameterized algorithms for multiterminal cuts
- Fixed-Parameter Tractability of Multicut Parameterized by the Size of the Cutset
- Fixed-parameter tractability of multicut parameterized by the size of the cutset
- An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem
- SOFSEM 2006: Theory and Practice of Computer Science
Cited In (15)
- Experimental evaluation of a local search approximation algorithm for the multiway cut problem
- Improved parameterized and exact algorithms for cut problems on trees
- Linear-Time Parameterized Algorithms via Skew-Symmetric Multicuts
- Improving the integrality gap for multiway cut
- An \(O ^{*}(1.84^{k })\) parameterized algorithm for the multiterminal cut problem
- A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts
- An improved approximation algorithm of MULTIWAY CUT.
- Simple and improved parameterized algorithms for multiterminal cuts
- An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem
- Improving the integrality gap for multiway cut
- \textsc{Multicut} is FPT
- An improved fixed-parameter algorithm for max-cut parameterized by crossing number
- An improved parameterized algorithm for the minimum node multiway cut problem
- An \(O^\ast(1.84^k)\) parameterized algorithm for the multiterminal cut problem
- On structural parameterizations of the matching cut problem
This page was built for publication: An improved parameterized algorithm for the multicut problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3014297)
