Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Optimal placement of identical resources in a tree

From MaRDI portal
Publication:1184728
Jump to:navigation, search

DOI10.1016/0890-5401(92)90053-IzbMath0779.90055OpenAlexW2006767224MaRDI QIDQ1184728

Leonidas J. Guibas, Nancy D. Griffeth, Nancy A. Lynch, Michael J. Fischer

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

optimal placementidentical resources


Mathematics Subject Classification ID

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


Related Items (1)

Optimal placement of identical resources in a tree



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Optimal placement of identical resources in a tree
  • Vergleich der hypergeometrischen mit der Binomial-Verteilung
  • Ranggrößen als Schätzfunktionen
  • Probabilistic analysis of a network resource allocation algorithm
  • Monotone Convergence of Binomial Probabilities and a Generalization of Ramanujan's Equation


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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1184728&oldid=12048642"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 30 January 2024, at 01:10.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki