"On the complexity of branch-and-bound search for random trees."

Luc Devroye, Carlos Zamora-Cura (1999)

> Home

Details and statistics

DOI: 10.1002/(SICI)1098-2418(199907)14:4<309::AID-RSA2>3.0.CO;2-1

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/DevroyeZ99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rsa/DevroyeZ99
Luc Devroye, Carlos Zamora-Cura:
On the complexity of branch-and-bound search for random trees. Random Struct. Algorithms 14(4): 309-327 (1999)

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.