"Efficient Algorithms for Euclidean Steiner Minimal Tree on Near-Convex ..."

Anubhav Dhar, Soumita Hait, Sudeshna Kolay (2023)

> Home

Details and statistics

DOI: 10.4230/LIPICS.ISAAC.2023.25

access: open

type: Conference or Workshop Paper

metadata version: 2023-11-28

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/isaac/DharHK23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isaac/DharHK23
Anubhav Dhar, Soumita Hait, Sudeshna Kolay:
Efficient Algorithms for Euclidean Steiner Minimal Tree on Near-Convex Terminal Sets. ISAAC 2023: 25:1-25:17

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.