"Probabilistic analysis of divide-and-conquer heuristics for minimum ..."

Edward M. Reingold, Kenneth J. Supowit (1983)

> Home

Details and statistics

DOI: 10.1002/NET.3230130104

access: closed

type: Journal Article

metadata version: 2017-05-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/networks/ReingoldS83
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/ReingoldS83
Edward M. Reingold, Kenneth J. Supowit:
Probabilistic analysis of divide-and-conquer heuristics for minimum weighted euclidean matching. Networks 13(1): 49-66 (1983)

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.