31 citations · 41 across the 9 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.DS2018★ 1 cited
Red-Blue-Partitioned MST, TSP, and Matching
Matthew P. Johnson
Arkin et al.~\cite{ArkinBCCJKMM17} recently introduced \textit{partitioned pairs} network optimization problems: given a metric-weighted graph on pairs of nodes, the task is to…
cs.DS2018
Deciding the Closure of Inconsistent Rooted Triples is NP-Complete
Matthew P. Johnson
Interpreting three-leaf binary trees or {\em rooted triples} as constraints yields an entailment relation, whereby binary trees satisfying some rooted triples must also thus satisf…