"Minmax Tree Cover in the Euclidean Space."

Seigo Karakawa, Ehab Morsy, Hiroshi Nagamochi (2011)

> Home

Details and statistics

DOI: 10.7155/JGAA.00230

access: open

type: Journal Article

metadata version: 2021-02-16

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jgaa/KarakawaMN11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jgaa/KarakawaMN11
Seigo Karakawa, Ehab Morsy, Hiroshi Nagamochi:
Minmax Tree Cover in the Euclidean Space. J. Graph Algorithms Appl. 15(3): 345-371 (2011)

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.