"Polynomially bounded algorithms for locating p-centers on a tree."

R. Chandrasekaran, Arie Tamir (1982)

> Home

Details and statistics

DOI: 10.1007/BF01581045

access: closed

type: Journal Article

metadata version: 2017-05-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mp/ChandrasekaranT82
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mp/ChandrasekaranT82
R. Chandrasekaran, Arie Tamir:
Polynomially bounded algorithms for locating p-centers on a tree. Math. Program. 22(1): 304-315 (1982)

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.