Kernelization and randomized parameterized algorithms for co-path set problem

DOI10.1007/S10878-015-9901-YMaRDI QIDQ328686zbMATH OpenOpenAlexFDO

Authors Qilong Feng, Qian Zhou, Jianxin Wang

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)

Recommendations

• Randomized parameterized algorithms for co-path set problem
• A fast parameterized algorithm for co-path set
• Randomized parameterized algorithms for \(P_2\)-packing and co-path packing problems
• Random methods for parameterized problems
• Improved kernel results for some FPT problems based on simple observations

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• An approximation algorithm for the minimum co-path set problem
• Radiation hybrid map construction problem parameterized
• Randomized parameterized algorithms for \(P_2\)-packing and co-path packing problems

Cited in

(6)

• Random methods for parameterized problems
• Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
• Randomized parameterized algorithms for co-path set problem
• Faster deterministic algorithm for \textsc{Co-Path Set}
• A fast parameterized algorithm for co-path set
• An approximation algorithm for the \(l\)-pseudoforest deletion problem

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

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