Kernelization and randomized parameterized algorithms for co-path set problem

DOI10.1007/S10878-015-9901-YzbMATH Open1378.90082OpenAlexW436750829MaRDI QIDQ328686FDOQ328686

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)

Cites Work

• Title not available (Why is that?)
• Randomized parameterized algorithms for \(P_2\)-packing and co-path packing problems
• Contracting graphs to paths and trees
• Radiation Hybrid Map Construction Problem Parameterized
• An approximation algorithm for the minimum co-path set problem

Cited In (3)

• Faster deterministic algorithm for \textsc{Co-Path Set}
• Coresets, sparse greedy approximation, and the Frank-Wolfe algorithm
• 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)