On product covering in 3-tier supply chain models: natural complete problems for W[3] and W[4]

DOI10.1016/j.tcs.2006.07.016zbMath1154.68055OpenAlexW2005505145MaRDI QIDQ860874

Fenghui Zhang, Jian'er Chen

Publication date: 9 January 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.07.016

zbMATH Keywords

complexityfixed parameter tractableW-hierarchy

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Production models (90B30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (7)

Synchronizing words and monoid factorization, yielding a new parameterized complexity class? ⋮ On the parameterised complexity of string morphism problems ⋮ Invited talks ⋮ A multi-parameter analysis of hard problems on deterministic finite automata ⋮ Efficiently enumerating hitting sets of hypergraphs arising in data profiling ⋮ The complexity of dependency detection and discovery in relational databases ⋮ On the complexity of solution extension of optimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Deciding the Vapnik-Červonenkis dimension is \(\Sigma_3^p\)-complete
• Supply chain management: Models, applications, and research directions
• The Turing way to parameterized complexity
• Parameterized computation and complexity: a new approach dealing with NP-hardness
• Vertex Cover: Further Observations and Further Improvements
• Linear FPT reductions and computational lower bounds
• Network optimization in supply chain management and financial engineering: An annotated bibliography

This page was built for publication: On product covering in 3-tier supply chain models: natural complete problems for W[3] and W[4]