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

Binay K. Bhattacharya, Tsunehiko Kameda (2012)

> Home

Details and statistics

DOI: 10.1007/978-3-642-32241-9_1

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-23

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/cocoon/BhattacharyaK12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/cocoon/BhattacharyaK12
Binay K. Bhattacharya, Tsunehiko Kameda:
A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree. COCOON 2012: 1-12

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.