The probabilistic minimum spanning tree problem : Part I--complexity and combinatorial properties
主要作者: | |
---|---|
其他作者: | |
格式: | Working Paper |
出版: |
Cambridge, Mass. : Sloan School of Management, Massachusetts Institute of Technology
2009
|
在线阅读: | http://hdl.handle.net/1721.1/48847 |