Polynomial-Time Data Reduction for the Subset Interconnection Design Problem (Q3453561)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial-Time Data Reduction for the Subset Interconnection Design Problem |
scientific article |
Statements
Polynomial-Time Data Reduction for the Subset Interconnection Design Problem (English)
0 references
27 November 2015
0 references
NP-hard problem
0 references
fixed-parameter tractability
0 references
kernelization
0 references
combinatorial algorithms
0 references
preprocessing
0 references
hypergraph support
0 references
