📣 Help Shape the Future of UKRI's Gateway to Research (GtR)

We're improving UKRI's Gateway to Research and are seeking your input! If you would be interested in being interviewed about the improvements we're making and to have your say about how we can make GtR more user-friendly, impactful, and effective for the Research and Innovation community, please email gateway@ukri.org.

A $$\nicefrac {4}{3}$$-Approximation for the Maximum Leaf Spanning Arborescence Problem in DAGs

First Author: Neuwohner M

Attributed to: New perspectives towards Woodall's Conjecture and the Generalised Berge-Fulkerson Conjecture funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1007/978-3-031-59835-7_25

Publication URI: http://dx.doi.org/10.1007/978-3-031-59835-7_25

Type: Book Chapter

Book Title: Integer Programming and Combinatorial Optimization - 25th International Conference, IPCO 2024, Wroclaw, Poland, July 3-5, 2024, Proceedings (2024)

Page Reference: 337-350