Dealing with several parameterized problems by random methods
type: Item
instance of: scholarly article
title: Dealing with several parameterized problems by random methods
zbMATH Open document ID: 1393.68131
author: Qilong Feng
author: Neng Huang
author: Xiong Jiang
author: Jianxin Wang
published in: Theoretical Computer Science
publication date: 2018-06-05T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68W20
zbMATH DE Number: 6880829
zbMATH Keywords: random methods
zbMATH Keywords: parameterized \(P_3\)-packing
zbMATH Keywords: parameterized load coloring
zbMATH Keywords: parameterized claw-free edge deletion
MaRDI profile type: MaRDI publication profile
full work available at URL: j.tcs.2017.09.024
OpenAlex ID: W2756563550
cites work: On the minimum load coloring problem
cites work: Parameterized and approximation algorithms for the load coloring problem
cites work: Scheduling Split Intervals
cites work: Parameterized computational complexity of Dodgson and Young elections
cites work: Packing paths: recycling saves time
cites work: Narrow sieves for parameterized paths and packings
cites work: Improved deterministic algorithms for weighted matching and packing problems
cites work: Approximating maximum agreement forest on multiple binary trees
cites work: Improved parameterized set splitting algorithms: A Probabilistic approach
cites work: Q2934608
cites work: Polynomial Kernelization for Removing Induced Claws and Diamonds
cites work: Parameterized Algorithms
cites work: Graph-Theoretic Concepts in Computer Science
cites work: Q3138921
cites work: Fixed-parameter complexity in AI and nonmonotonic reasoning
cites work: Parameterized algorithms for load coloring problem
cites work: On the Size of Systems of Sets Every t of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems
cites work: Improved kernel results for some FPT problems based on simple observations
cites work: Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree
cites work: Partition on trees with supply and demand: kernelization and algorithms
cites work: On the completeness of a generalized matching problem
cites work: On the Complexity of General Graph Factor Problems
cites work: Fixed-parameter tractability of multicut parameterized by the size of the cutset
DOI: 10.1016/J.TCS.2017.09.024
description: scientific article; zbMATH DE number 6880829