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

DOI10.1016/j.jcss.2023.02.006OpenAlexW3216012570MaRDI QIDQ2698292

Carla Negri Lintzmayer, Cristina G. Fernandes

Publication date: 21 April 2023

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

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

zbMATH Keywords

approximation algorithmsdirected acyclic graphsmaximum leaf spanning arborescenceweighted independent sets

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A 2-approximation algorithm for finding a spanning tree with maximum number of leaves
• Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness
• Greedy Local Improvement and Weighted Set Packing Approximation
• Approximation Algorithms for the Maximum Leaf Spanning Tree Problem on Acyclic Digraphs
• Kernel(s) for problems with no kernel
• On Finding Directed Trees with Many Leaves
• Spanning Directed Trees with Many Leaves
• Broadcasting on Random Directed Acyclic Graphs
• Paths, Trees, and Flowers
• Leafy spanning arborescences in DAGs
• Leafy spanning arborescences in DAGs

This page was built for publication: How heavy independent sets help to find arborescences with many leaves in DAGs