Optimal placement of identical resources in a tree
DOI10.1016/0890-5401(92)90053-IzbMATH Open0779.90055OpenAlexW2006767224MaRDI QIDQ1184728FDOQ1184728
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
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
Trees (05C05) Deterministic network models in operations research (90B10) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Abstract computational complexity for mathematical programming problems (90C60) Communication networks in operations research (90B18) Discrete location and assignment (90B80)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Monotone Convergence of Binomial Probabilities and a Generalization of Ramanujan's Equation
- Ranggrößen als Schätzfunktionen
- Vergleich der hypergeometrischen mit der Binomial-Verteilung
- Probabilistic analysis of a network resource allocation algorithm
- Optimal placement of identical resources in a tree
Cited In (5)
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)
