Two Matching Based Algorithm for Tree Network Design
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 6297807
- An efficient algorithm for some tree matching problems
- scientific article; zbMATH DE number 1094324
- Analysis of heuristics for the design of tree networks
- Routing on trees via matchings
- A method of solution of algebraic equations systems in the design of tree networks
- An effective algorithm for the two-stage location problem on a tree-like network
- Matching complexes of trees and applications of the matching tree algorithm
- Efficiency of algorithms for solution of network problems with tree-like data structure
- Tree matchings
Cites work
- Centralized teleprocessing network design
- Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
- Heuristics with Constant Error Guarantees for the Design of Tree Networks
- Heuristics with Constant Error Guarantees for the Multi Center Capacitated Minimum Spanning Tree Problem
- The Capacitated Minimum Spanning Tree
- Topological design of centralized computer networks—formulations and algorithms
Cited in
(4)
This page was built for publication: Two Matching Based Algorithm for Tree Network Design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4297157)
