Fully polynomial approximation schemes for locating a tree-shaped facility: A generalization of the knapsack problem (Q1270784): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q126297015 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2052548593 / rank | |||
Normal rank | |||
Latest revision as of 11:11, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fully polynomial approximation schemes for locating a tree-shaped facility: A generalization of the knapsack problem |
scientific article |
Statements
Fully polynomial approximation schemes for locating a tree-shaped facility: A generalization of the knapsack problem (English)
0 references
3 November 1998
0 references
facility location
0 references
tree-shaped facility
0 references
Tamir
0 references
subtree
0 references
NP-hard
0 references
knapsack problem
0 references
fully polynomial approximation schemes
0 references
