An FPT 2-approximation for tree-cut decomposition

DOI10.1007/978-3-319-28684-6_4MaRDI QIDQ6827627zbMATH OpenFDO

Authors Eun Jung Kim, Sang-Il Oum, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos

Publication date 26 February 2016

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-28684-6_4

zbMATH Keywords

approximation algorithmfixed-parameter tractable algorithmtree-cut width

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

This page was built for publication: An FPT 2-approximation for tree-cut decomposition

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6827627)