Back to Results
First PageMeta Content
Mathematics / 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 Innova
Add to Reading List

Document Date: 2013-02-26 21:19:15


Open Document

File Size: 500,69 KB

Share Result on Facebook