The parameterized complexity of the shared center problem
DOI10.1007/978-3-642-31265-6_35zbMATH Open1358.68125OpenAlexW2132346653MaRDI QIDQ2904516FDOQ2904516
Lusheng Wang, Wenji Ma, Zhi-Zhong Chen
Publication date: 14 August 2012
Published in: Combinatorial Pattern Matching (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-31265-6_35
Recommendations
- The parameterized complexity of the shared center problem
- The parameterized complexity of sequence alignment and consensus
- scientific article; zbMATH DE number 2086391
- On the parameterized intractability of motif search problems
- On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
pedigreeparameterized complexityparameterized algorithmslinkage analysishaplotype inferenceallele-sharing status
Genetics and epigenetics (92D10) Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Cited In (5)
- On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality
- On the Complexity of the Elzinga-Hearn Algorithm for the 1-Center Problem
- Un nuevo resultado sobre la complejidad del problema delP-centro
- A Polynomial Time Approximation Scheme for the Closest Shared Center Problem
- \(\mathsf{W[1]}\)-hardness of the \(k\)-center problem parameterized by the skeleton dimension
This page was built for publication: The parameterized complexity of the shared center problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2904516)
