Kernelization and randomized parameterized algorithms for co-path set problem

DOI10.1007/S10878-015-9901-YzbMath1378.90082OpenAlexW436750829MaRDI QIDQ328686

Qian Zhou, Jianxin Wang, Qilong Feng

Publication date: 20 October 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-015-9901-y

zbMATH Keywords

randomized algorithmkernelizationco-path set

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90)

Related Items (2)

Faster deterministic algorithm for \textsc{Co-Path Set} ⋮ An approximation algorithm for the \(l\)-pseudoforest deletion problem

Cites Work

• Unnamed Item
• An approximation algorithm for the minimum co-path set problem
• Randomized parameterized algorithms for \(P_2\)-packing and co-path packing problems
• Contracting graphs to paths and trees
• Radiation Hybrid Map Construction Problem Parameterized

This page was built for publication: Kernelization and randomized parameterized algorithms for co-path set problem