"Tight Approximation Bounds on a Simple Algorithm for Minimum Average ..."

Svein Høgemo (2024)

> Home

Details and statistics

DOI: 10.1007/978-3-031-81396-2_8

access: closed

type: Conference or Workshop Paper

metadata version: 2025-02-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/waoa/Hogemo24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/waoa/Hogemo24
Svein Høgemo:
Tight Approximation Bounds on a Simple Algorithm for Minimum Average Search Time in Trees. WAOA 2024: 104-118

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.