"A $\nicefrac {4}{3}$-approximation for the maximum leaf spanning ..."

Meike Neuwohner (2026)

> Home

Details and statistics

DOI: 10.1007/S10107-025-02233-0

access: closed

type: Journal Article

metadata version: 2026-05-08

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mp/Neuwohner26
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mp/Neuwohner26
Meike Neuwohner:
A $\nicefrac {4}{3}$-approximation for the maximum leaf spanning arborescence problem in DAGs. Math. Program. 216(1): 111-133 (2026)

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.