"Polynomial Time 2-Approximation Algorithms for the Minmax Subtree Cover ..."

Hiroshi Nagamochi, Kohei Okada (2003)

> Home

Details and statistics

DOI: 10.1007/978-3-540-24587-2_16

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/isaac/NagamochiO03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isaac/NagamochiO03
Hiroshi Nagamochi, Kohei Okada:
Polynomial Time 2-Approximation Algorithms for the Minmax Subtree Cover Problem. ISAAC 2003: 138-147

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.