"The rectilinear Steiner arborescence problem is NP-complete."

Weiping Shi, Chen Su (2000)

> Home

Details and statistics

DOI: —

access: closed

type: Conference or Workshop Paper

metadata version: 2012-12-07

- view
  - electronic edition @ acm.org
- export record
  dblp key:
  - conf/soda/ShiS00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/ShiS00
Weiping Shi, Chen Su:
The rectilinear Steiner arborescence problem is NP-complete. SODA 2000: 780-787

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.