View in EDS HTML Full Text PDF Full Text

A 43-approximation for the maximum leaf spanning arborescence problem in DAGs.

Saved in:
Bibliographic Details
Title: A 43-approximation for the maximum leaf spanning arborescence problem in DAGs.
Authors: Neuwohner, Meike1 (AUTHOR) work@meike-neuwohner.de
Source: Mathematical Programming. Mar2026, Vol. 216 Issue 1/2, p111-133. 23p.
Database: Business Source Ultimate
Full text is not displayed to guests.
Description
ISSN:00255610
DOI:10.1007/s10107-025-02233-0