Leafy spanning arborescences in DAGs

DOI10.1007/978-3-030-61792-9_5OpenAlexW3115320683MaRDI QIDQ5918501

Carla Negri Lintzmayer, Cristina G. Fernandes

Publication date: 13 October 2022

Published in: LATIN 2020: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2007.07660

zbMATH Keywords

approximation algorithmsdirected acyclic graphsmaximum leaf spanning arborescencemaximum leaf weighted spanning arborescence

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)

Related Items (1)

How heavy independent sets help to find arborescences with many leaves in DAGs

This page was built for publication: Leafy spanning arborescences in DAGs