Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Covering minimum spanning trees of random subgraphs."

Michel X. Goemans, Jan Vondrák (2006)

> Home

Details and statistics

DOI: 10.1002/RSA.20115

access: closed

type: Journal Article

metadata version: 2017-05-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/rsa/GoemansV06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rsa/GoemansV06
Michel X. Goemans, Jan Vondrák:
Covering minimum spanning trees of random subgraphs. Random Struct. Algorithms 29(3): 257-276 (2006)

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.