Date: 2013-02-26 21:19:15Mathematics Graph theory Computational complexity theory Combinatorial optimization Submodular set function Edsger W. Dijkstra NP-complete problems Algorithm Shortest path problem HeldKarp algorithm Dominating set | | Maximizing Submodular Set Function with Connectivity Constraint: Theory and Application to Networks Tung-Wei Kuo† ‡ , Kate Ching-Ju Lin† , and Ming-Jer Tsai‡ † Research Center for Information Technology InnovaAdd to Reading ListSource URL: nms.citi.sinica.edu.twDownload Document from Source Website File Size: 500,69 KBShare Document on Facebook
|