A linear-size zero - one programming model for the minimum spanning tree problem in planar graphs

Justin C. Williams. A linear-size zero - one programming model for the minimum spanning tree problem in planar graphs. Networks, 39(1):53-60, 2002. [doi]

Abstract

Abstract is missing.