The complexity of computation and approximation of the \(t\)-ratio over one-dimensional interval data (Q1623689)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The complexity of computation and approximation of the \(t\)-ratio over one-dimensional interval data |
scientific article; zbMATH DE number 6984073
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of computation and approximation of the \(t\)-ratio over one-dimensional interval data |
scientific article; zbMATH DE number 6984073 |
Statements
The complexity of computation and approximation of the \(t\)-ratio over one-dimensional interval data (English)
0 references
23 November 2018
0 references
interval data
0 references
\(t\)-ratio
0 references
computational complexity
0 references
NP-hardness
0 references
inapproximability
0 references
pseudopolynomial algorithms
0 references
0 references
0 references
0 references
0 references
