Two Matching Based Algorithm for Tree Network Design (Q4297157): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Heuristics with Constant Error Guarantees for the Design of Tree Networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Heuristics with Constant Error Guarantees for the Multi Center Capacitated Minimum Spanning Tree Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Capacitated Minimum Spanning Tree / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Topological design of centralized computer networks—formulations and algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Centralized teleprocessing network design / rank | |||
Normal rank | |||
Latest revision as of 16:38, 22 May 2024
scientific article; zbMATH DE number 597432
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Two Matching Based Algorithm for Tree Network Design |
scientific article; zbMATH DE number 597432 |
Statements
Two Matching Based Algorithm for Tree Network Design (English)
0 references
29 June 1994
0 references
parallel saving algorithm
0 references
heuristic
0 references
local access tree network design
0 references
NP-complete
0 references
0 references
