Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"On the Inapproximability of Disjoint Paths and Minimum Steiner Forest with ..."

Bin Ma, Lusheng Wang (2000)

> Home

Details and statistics

DOI: 10.1006/JCSS.1999.1661

access: open

type: Journal Article

metadata version: 2023-03-14

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jcss/MaW00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcss/MaW00
Bin Ma, Lusheng Wang:
On the Inapproximability of Disjoint Paths and Minimum Steiner Forest with Bandwidth Constraints. J. Comput. Syst. Sci. 60(1): 1-12 (2000)

a service of

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.