Indirect covering tree problems on spanning tree networks (Q2368291): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0377-2217(93)90141-9 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2006578777 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Multiobjective programming and planning / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Maximal Direct Covering Tree Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3479805 / rank | |||
Normal rank | |||
Latest revision as of 18:37, 17 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Indirect covering tree problems on spanning tree networks |
scientific article |
Statements
Indirect covering tree problems on spanning tree networks (English)
0 references
24 August 1993
0 references
facility location
0 references
tree algorithms
0 references
minimum cost covering subtree
0 references
indirect covering tree
0 references
spanning tree
0 references
backbone network
0 references
