258 research outputs found
The Submodular Santa Claus Problem in the Restricted Assignment Case
The submodular Santa Claus problem was introduced in a seminal work by Goemans, Harvey, Iwata, and Mirrokni (SODA\u2709) as an application of their structural result. In the mentioned problem n unsplittable resources have to be assigned to m players, each with a monotone submodular utility function f_i. The goal is to maximize min_i f_i(S_i) where S?,...,S_m is a partition of the resources. The result by Goemans et al. implies a polynomial time O(n^{1/2 +?})-approximation algorithm.
Since then progress on this problem was limited to the linear case, that is, all f_i are linear functions. In particular, a line of research has shown that there is a polynomial time constant approximation algorithm for linear valuation functions in the restricted assignment case. This is the special case where each player is given a set of desired resources ?_i and the individual valuation functions are defined as f_i(S) = f(S ? ?_i) for a global linear function f. This can also be interpreted as maximizing min_i f(S_i) with additional assignment restrictions, i.e., resources can only be assigned to certain players.
In this paper we make comparable progress for the submodular variant: If f is a monotone submodular function, we can in polynomial time compute an O(log log(n))-approximate solution
A Hit-and-Run approach for generating scale invariant Small World networks
Hit-and-Run is a well-known class of Markov chain algorithms for sampling from essentially arbitrary distributions over bounded regions of the Euclidean space. We present a class of Small World network models constructed using Hit-and-Run in a Euclidean ball. We prove that there is a unique scale invariant model in this class that admits efficient search by a decentralized algorithm. This research links two seemingly unrelated areas: Markov chain sampling techniques and scale invariant Small World networks, and may have interesting implications for stochastic search methods for continuous optimization. © 2008 Wiley Periodicals, Inc. NETWORKS, 2009Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/61434/1/20262_ftp.pd
- …