Two Matching Based Algorithm for Tree Network Design (Q4297157): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
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.1080/02522667.1994.10699182 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1987793273 / rank
 
Normal rank
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