"Max-leaves spanning tree is APX-hard for cubic graphs."

Paul S. Bonsma (2012)

> Home

Details and statistics

DOI: 10.1016/J.JDA.2011.06.005

access: open

type: Journal Article

metadata version: 2021-02-16

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jda/Bonsma12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jda/Bonsma12
Paul S. Bonsma:
Max-leaves spanning tree is APX-hard for cubic graphs. J. Discrete Algorithms 12: 14-23 (2012)

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.