This paper has always been one of my favorite “children,” combining as it does elements of the duality of linear programming and combinatorial tools from graph theory. It may be of some interest to… Expand

This paper has always been one of my favorite “children,” combining as it does elements of the duality of linear programming and combinatorial tools from graph theory.Expand

This note calls attention to the work of Weiszfeld in 1937, who may have been the first to propose an iterative algorithm for the General Fermat Problem.Expand

A Cubical Sperner Lemma follows immediately from the Brouwer Fixed Point Theorem and thus opens the possibility of other applications of topology to combinatorial problems.Expand