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

Probabilistic analysis of power assignments

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

DOI10.1002/rsa.20714zbMath1382.90045arXiv1403.5882OpenAlexW3021652151MaRDI QIDQ5371144

Bodo Manthey, Maurits de Graaf

Publication date: 24 October 2017

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1403.5882


zbMATH Keywords

complete convergenceaverage-case analysisEuclidean optimization problemspower assignments


Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)


Related Items (2)

Probabilistic properties of highly connected random geometric graphs ⋮ An average case analysis of the minimum spanning tree heuristic for the power assignment problem






This page was built for publication: Probabilistic analysis of power assignments

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