The complexity of the capacitated tree problem (Q3886877): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Q197784 / rank | |||
| Property / author | |||
| Property / author: Christos H. Papadimitriou / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.3230080306 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1972674272 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 22:03, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of the capacitated tree problem |
scientific article |
Statements
The complexity of the capacitated tree problem (English)
0 references
1978
0 references
capacitated tree problem
0 references
spanning tree
0 references
NP-complete
0 references
Euclidean capacitated tree problem
0 references
