"Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree."

Davide Bilò, Luciano Gualà, Guido Proietti (2014)

> Home

Details and statistics

DOI: 10.1007/S00453-012-9674-Y

access: closed

type: Journal Article

metadata version: 2022-06-23

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/BiloGP14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/BiloGP14
Davide Bilò, Luciano Gualà, Guido Proietti:
Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree. Algorithmica 68(2): 337-357 (2014)

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.