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) …

The study of combinatorial problems with a submodular objective function has attracted
much attention in recent years, and is partly motivated by the importance of such problems to …

We study a general stochastic probing problem defined on a universe V, where each
element e∈ V is “active” independently with probability pe. Elements have weights {we: e∈ …

Consider a random graph model where each possible edge e is present independently with
some probability pe. Given these probabilities, we want to build a large/heavy matching in …

Submodular maximization generalizes many fundamental problems in discrete optimization,
including Max-Cut in directed/undirected graphs, maximum coverage, maximum facility …

There is a wide range of different approaches and tool for cross-platform mobile application
development. We studied the performance characteristic of the mobile applications …

Contention resolution schemes have proven to be an incredibly powerful concept which
allows tackling a broad class of problems. The framework has been initially designed to …

We give new approximation algorithms for packing integer programs (PIPs) by employing
the method of randomized rounding combined with alterations. Our first result is a simpler …

We study incentive compatible mechanisms for combinatorial auctions (CAs) in an online
model with sequentially arriving bidders, where the arrivals' order is either random or …

Heterogeneous cellular networks that overlay cache-endowed small-cell networks with
macro-cell networks have emerged as a promising solution towards ultra-low latency, extra …