Random methods for parameterized problems

DOI10.1007/978-3-642-38768-5_10MaRDI QIDQ4925228zbMATH OpenOpenAlexFDO

Authors Qilong Feng, Jianxin Wang, Shao-Hua Li, Jianer Chen

Publication date 11 June 2013

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

Full work available at URL https://doi.org/10.1007/978-3-642-38768-5_10

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20)

Recommendations

• Randomized parameterized algorithms for P₂-packing and co-path packing problems
• Dealing with several parameterized problems by random methods
• Improved algorithms for several parameterized problems based on random methods
• Randomized divide-and-conquer: improved path, matching, and packing algorithms
• Kernelization and randomized parameterized algorithms for co-path set problem

Cited in

(12)

• Random relaxed Dirichlet problems
• Randomized Verblunsky parameters in Steklov's problem
• Randomized parameterized algorithms for P₂-packing and co-path packing problems
• Randomized fixed-parameter algorithms for the closest string problem
• Dealing with several parameterized problems by random methods
• Randomized parameterized algorithms for co-path set problem
• Kernelization and randomized parameterized algorithms for co-path set problem
• Random Separation: A New Method for Solving Fixed-Cardinality Optimization Problems
• Randomized Disposal of Unknowns and Implicitly Enforced Bounds on Parameters
• Randomized divide-and-conquer: improved path, matching, and packing algorithms
• scientific article; zbMATH DE number 2014390 (Why is no real title available?)
• Improved algorithms for several parameterized problems based on random methods

This page was built for publication: Random methods for parameterized problems

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