We show that the standard linear programming relaxation for the tree augmentation problem in undirected graphs has an integrality ratio that approaches 3 2 . This refutes a conjec...
Joseph Cheriyan, Howard J. Karloff, Rohit Khandeka...
The linear systems associated with large, sparse, symmetric, positive deļ¬nite matrices are often solved iteratively using the preconditioned conjugate gradient method. We have d...
Barrier trees are a convenient way of representing the structure of complex combinatorial landscapes over graphs. Here we generalize the concept of barrier trees to landscapes deļ...
Bodlaenderās Theorem states that for every k there is a linear-time algorithm that decides whether an input graph has tree width k and, if so, computes a width-k tree compositio...
A tanglegram is a pair of trees on the same set of leaves with matching leaves in the two trees joined by an edge. Tanglegrams are widely used in biology ā to compare evolutiona...
Balaji Venkatachalam, Jim Apple, Katherine St. Joh...