10 citations · 11 across the 9 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2024
A Simple 4-Approximation Algorithm for Maximum Agreement Forests on Multiple Unrooted Binary Trees
Jordan Dempsey, Leo van Iersel, Mark Jones +1
We present a simple 4-approximation algorithm for computing a maximum agreement forest of multiple unrooted binary trees. This algorithm applies LP rounding to an extension of a re…
cs.DS2024★ 1 cited
Exact and Heuristic Computation of the Scanwidth of Directed Acyclic Graphs
Niels Holtgrefe, Leo van Iersel, Mark Jones
To measure the tree-likeness of a directed acyclic graph (DAG), a new width parameter that considers the directions of the arcs was recently introduced: scanwidth. We present the f…