We consider the problem of maximizing a non-negative submodular set function f:2N -> RR+ over a ground set N subject to a variety of packing type constraints including (multiple) matroid constraints,â€¦ (More)

2010 IEEE 51st Annual Symposium on Foundations ofâ€¦

2010

We consider the problem of randomly rounding a fractional solution $x$ in an integer polytope $P \subseteq [0,1]^n$ to a vertex $X$ of $P$, so that $\E[X] = x$. Our goal is to achieve {\emâ€¦ (More)

We consider the wireless relay network model as introduced by Avestimehr, Diggavi and Tse [2] for approximating Gaussian relay channels and show that it is a special case of a more abstract flowâ€¦ (More)

Motivated by multi-budgeted optimization and other applications, we consider the problem of randomly rounding a fractional solution x in the (non-bipartite graph) matching and matroid intersectionâ€¦ (More)

Motivated by several applications, we consider the problem of randomly rounding a fractional solution in a matroid (base) polytope to an integral one. We consider t hepipage roundingtechnique [5, 6,â€¦ (More)

In the matching interdiction problem, we are given an undirected graph with weights and interdiction costs on the edges and seek to remove a subset of the edges constrained to some budget, such thatâ€¦ (More)

We introduce polylinking networks, which is a flow model based on polylinking systems that generalizes the classical flow model of Ford and Fulkerson on acyclic networks and has applications in theâ€¦ (More)