"An approximation algorithm for the maximum leaf spanning arborescence problem."

Matthew Drescher, Adrian Vetta (2010)

> Home

Details and statistics

DOI: 10.1145/1798596.1798599

access: closed

type: Journal Article

metadata version: 2018-11-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/talg/DrescherV10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/talg/DrescherV10
Matthew Drescher, Adrian Vetta:
An approximation algorithm for the maximum leaf spanning arborescence problem. ACM Trans. Algorithms 6(3): 46:1-46:18 (2010)

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.