Minimum cost flow‐dependent communication networks (Q5487822): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: DBLP publication ID (P1635): journals/networks/ThomasW06, #quickstatements; #temporary_batch_1731468600454 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: Q4945796 / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/networks/ThomasW06 / rank | |||
Normal rank | |||
Latest revision as of 05:29, 13 November 2024
scientific article; zbMATH DE number 5052645
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum cost flow‐dependent communication networks |
scientific article; zbMATH DE number 5052645 |
Statements
Minimum cost flow‐dependent communication networks (English)
0 references
12 September 2006
0 references
communication network
0 references
flow-dependent network
0 references
Gilbert network
0 references
Steiner tree
0 references
