"Parallel approximation algorithms for minimum routing cost spanning tree."

Kun Chen, Yung En Hsieh, Ping Jung Lu (2013)

> Home

Details and statistics

DOI: 10.1504/IJCSE.2013.057298

access: closed

type: Journal Article

metadata version: 2020-07-30

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/ijcse/ChenHL13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/ijcse/ChenHL13
Kun Chen, Yung En Hsieh, Ping Jung Lu:
Parallel approximation algorithms for minimum routing cost spanning tree. Int. J. Comput. Sci. Eng. 8(4): 336-348 (2013)

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.