Submodularity of minimum-cost spanning tree games

Abstract

We give a necessary condition and a sufficient condition for a minimum-cost spanning tree game introduced by Bird to be submodular (or convex). When the cost is restricted to two values, we give a characterization of submodular minimum-cost spanning tree games. We also discuss algorithmic issues. 
DOI: 10.1002/net.21540

2 Figures and Tables

Topics

  • Presentations referencing similar topics