Login / Signup
A $\nicefrac {4}{3}$-Approximation for the Maximum Leaf Spanning Arborescence Problem in DAGs.
Meike Neuwohner
Published in:
IPCO (2024)
Keyphrases
</>
approximation methods
directed acyclic graph
error bounds
approximation error
database
approximation algorithms
maximum number
integrality gap
multiscale
approximation schemes
databases
information systems
efficient computation
relative error