"Minimum-Cost Node-Disjoint Steiner Trees in Series-Parallel Networks."

Sunil Chopra, Kalyan T. Talluri (1996)

> Home

Details and statistics

DOI: 10.1155/1996/43738

access: open

type: Journal Article

metadata version: 2024-05-07

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/vlsi/ChopraT96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/vlsi/ChopraT96
Sunil Chopra, Kalyan T. Talluri:
Minimum-Cost Node-Disjoint Steiner Trees in Series-Parallel Networks. VLSI Design 4(1): 53-57 (1996)

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.