"The 2-connected bottleneck Steiner network problem is NP-hard in any ..."

Marcus Brazil et al. (2019)

> Home

Details and statistics

DOI: —

access: open

type: Informal or Other Publication

metadata version: 2019-07-17

- view
  - electronic edition @ arxiv.org (open access)
- export record
  dblp key:
  - journals/corr/abs-1907-03474
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-1907-03474
Marcus Brazil, Charl J. Ras, Doreen A. Thomas, G. Xu:
The 2-connected bottleneck Steiner network problem is NP-hard in any 𝓁_p plane. CoRR abs/1907.03474 (2019)

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.