<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2015-04-27 05:26:50Computational complexity theory Graph theory Mathematics NP-complete problems Steiner tree problem Approximation algorithm APX Spanning tree Optimization problem Wiener connector Travelling salesman problem |
Add to Reading List |
A Compendium on Steiner Tree Problems Editors: M. Hauptmann and M. Karpinski Department of Computer Science and | The Minimum Wiener Connector Problem Natali Ruchansky Computer Science Dept. Boston University, USADocID: 1sQsc - View Document |
| A Compendium on Steiner Tree Problems Editors: M. Hauptmann and M. Karpinski Department of Computer Science andDocID: 1pSTb - View Document |
 | Data Mining and Knowledge Discovery manuscript No. (will be inserted by the editor) Fast approximation of betweenness centrality through sampling Matteo Riondato ·DocID: 1ozfq - View Document |