"A Tight Lower Bound for the Steiner Point Removal Problem on Trees."

T.-H. Hubert Chan et al. (2006)

> Home

Details and statistics

DOI: 10.1007/11830924_9

access: closed

type: Conference or Workshop Paper

metadata version: 2022-10-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/approx/ChanXKR06
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/approx/ChanXKR06
T.-H. Hubert Chan, Donglin Xia, Goran Konjevod, Andréa W. Richa:
A Tight Lower Bound for the Steiner Point Removal Problem on Trees. APPROX-RANDOM 2006: 70-81

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.