Strongly polynomial simplex algorithm for bipartite vertex packing

Abstract

This paper gives a new algorithm to solve the weighted vertex packing problem on a bipartite graph via strong spanning trees. The algorithm is a special implementation of the primal simplex algorithm applied to the linear programming statement of the problem. Using a simple node labeling scheme, the algorithm has a strongly polynomial complexity.