"A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning ..."

Bang Ye Wu et al. (1998)

> Home

Details and statistics

DOI: —

access: closed

type: Conference or Workshop Paper

metadata version: 2015-08-31

- view
  - electronic edition @ acm.org
- export record
  dblp key:
  - conf/soda/WuLBCRT98
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/WuLBCRT98
Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao Chao, R. Ravi, Chuan Yi Tang:
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees. SODA 1998: 21-32

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.