"An improved algorithm for the minmax regret median problem on a tree."

Igor Averbakh, Oded Berman (2003)

> Home

Details and statistics

DOI: 10.1002/NET.10062

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/AverbakhB03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/AverbakhB03
Igor Averbakh, Oded Berman:
An improved algorithm for the minmax regret median problem on a tree. Networks 41(2): 97-103 (2003)

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.