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

Authors:
Jianer Chen;Fenghui Zhang
Affiliations:
Department of Computer Science, Texas A&M University, College Station, TX;Department of Computer Science, Texas A&M University, College Station, TX
Venue:
Theoretical Computer Science - Algorithmic applications in management
Year:
2006

Citing 7
Cited 0

Deciding the Vapnik-Ccaron;ervonenkis dimension is Sp3 -complete

Journal of Computer and System Sciences
Vertex cover: further observations and further improvements

Journal of Algorithms
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties

Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
Supply chain modeling: past, present and future

Computers and Industrial Engineering - Supply chain management
Linear FPT reductions and computational lower bounds

STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Designing And Managing The Supply Chain

Designing And Managing The Supply Chain
Parameterized Complexity

Parameterized Complexity

Quantified Score

Hi-index	0.00

Visualization

Abstract

The field of supply chain management has been growing at a rapid pace in recent years, both as a research area and as a practical discipline. In this paper, we study the computational complexity of product covering problems in 3-tier supply chain models, and present natural complete problems for the classes W[3] and W[4] in parameterized complexity theory. This seems the first group of natural complete problems for higher levels in the parameterized intractability hierarchy (i.e., the W-hierarchy), and the first precise complexity characterizations of certain optimization problems in the research of supply chain management. Our results also derive strong computational lower bounds and inapproximability for these optimization problems.