Abstract
We discuss how to incorporate data structures based on nested dissection into the IPM framework to obtain efficient LP solvers for a number of problems, including planar min-cost flow, planar k-multicommodity flow, LPs with low treewidth, and general separable LPs.