Optimal placement of identical resources in a tree

DOI10.1016/0890-5401(92)90053-IMaRDI QIDQ1184728zbMATH OpenOpenAlexFDO

Authors Michael Fischer, Nancy D. Griffeth, Leonidas Guibas, Nancy Lynch

Publication date 28 June 1992

Published in Information and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0890-5401(92)90053-i

zbMATH Keywords

identical resourcesoptimal placement

Mathematics Subject Classification ID

Trees (05C05) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Deterministic network models in operations research (90B10) Communication networks in operations research (90B18) Discrete location and assignment (90B80) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Dynamic and static algorithms for optimal placement of resources in a tree
• Placing resources in a tree: dynamic and static algorithms
• scientific article; zbMATH DE number 1115549
• An Optimal Algorithm for Weighted Minimax Flow Centers on Trees
• Resource allocation in rooted trees subject to sum constraints and nonlinear cost functions

Cites work

• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• scientific article; zbMATH DE number 3059214 (Why is no real title available?)
• Monotone Convergence of Binomial Probabilities and a Generalization of Ramanujan's Equation
• Optimal placement of identical resources in a tree
• Probabilistic analysis of a network resource allocation algorithm
• Ranggrößen als Schätzfunktionen
• Vergleich der hypergeometrischen mit der Binomial-Verteilung

Cited in

(7)

• Resource allocation in bounded degree trees
• Optimal placement of identical resources in a tree
• scientific article; zbMATH DE number 4083392 (Why is no real title available?)
• scientific article; zbMATH DE number 1115549 (Why is no real title available?)
• Placing resources in a tree: dynamic and static algorithms
• Resource allocation in rooted trees for VLSI applications
• Dynamic and static algorithms for optimal placement of resources in a tree

This page was built for publication: Optimal placement of identical resources in a tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1184728)