Abstract: We study the problem of incorporating risk while making combinatorial decisions under uncertainty. We formulate a discrete submodular maximization problem for selecting a set using ...
Chapters cover shortest paths, network flows, bipartite matching, nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the matroid parity problems. A suitable text or ...
Customer stories Events & webinars Ebooks & reports Business insights GitHub Skills ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results