"A polynomial time approximation scheme for the two-source minimum routing ..."

Bang Ye Wu (2002)

> Home

Details and statistics

DOI: 10.1016/S0196-6774(02)00205-5

access: closed

type: Journal Article

metadata version: 2017-05-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jal/Wu02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/Wu02
Bang Ye Wu:
A polynomial time approximation scheme for the two-source minimum routing cost spanning trees. J. Algorithms 44(2): 359-378 (2002)

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.