Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"An average case analysis of the minimum spanning tree heuristic for the ..."

Maurits de Graaf et al. (2019)

> Home

Details and statistics

DOI: 10.1002/RSA.20831

access: open

type: Journal Article

metadata version: 2023-09-30

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/rsa/GraafBHO19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rsa/GraafBHO19
Maurits de Graaf, Richard J. Boucherie, Johann L. Hurink, Jan-Kees C. W. van Ommeren:
An average case analysis of the minimum spanning tree heuristic for the power assignment problem. Random Struct. Algorithms 55(1): 89-103 (2019)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.