"A Stronger Lower Bound on Parametric Minimum Spanning Trees."

David Eppstein (2023)

> Home

Details and statistics

DOI: 10.1007/S00453-022-01024-9

access: open

type: Journal Article

metadata version: 2023-09-12

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/algorithmica/Eppstein23
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/Eppstein23
David Eppstein:
A Stronger Lower Bound on Parametric Minimum Spanning Trees. Algorithmica 85(6): 1738-1753 (2023)

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.