On the combinatorial lower bound for the extension complexity of the Spanning Tree polytope |
| |
Authors: | Kaveh Khoshkhah Dirk Oliver Theis |
| |
Affiliation: | Institute of Computer Science of the University of Tartu, Ülikooli 17, 51014 Tartu, Estonia |
| |
Abstract: | This paper concerns the extension complexity of the Minimum Spanning Tree problem on a complete graph with nodes. The best known lower bound is the trivial bound, , the best known upper bound is the extended formulation size (Wong 1980, Martin 1991). We give a nondeterministic communication protocol with cost for the support of the spanning tree slack matrix. |
| |
Keywords: | Extension complexity Communication complexity Spanning Tree Polytope |
本文献已被 ScienceDirect 等数据库收录! |