"A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree ..."

Binay K. Bhattacharya, Tsunehiko Kameda, Zhao Song (2014)

> Home

Details and statistics

DOI: 10.1007/S00453-013-9851-7

access: closed

type: Journal Article

metadata version: 2020-12-01

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/BhattacharyaKS14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/BhattacharyaKS14
Binay K. Bhattacharya, Tsunehiko Kameda, Zhao Song:
A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree Network. Algorithmica 70(1): 2-21 (2014)

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.