31 search results - page 1 / 7 » Approximability of Combinatorial Problems with Multi-agent S... |
FOCS
2009
IEEE
13 years 12 months ago
2009
IEEE
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...
FSTTCS
2010
Springer
13 years 3 months ago
2010
Springer
ABSTRACT. Motivated by economic thought, a recent research agenda has suggested the algorithmic study of combinatorial optimization problems under functions which satisfy the prope...
STOC
2012
ACM
11 years 7 months ago
2012
ACM
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
CORR
2012
Springer
12 years 28 days ago
2012
Springer
We present a new type of monotone submodular functions: multi-peak submodular functions. Roughly speaking, given a family of sets F, we construct a monotone submodular function f ...
CONSTRAINTS
2008
13 years 5 months ago
2008
Submodular function minimization is a polynomially-solvable combinatorial problem. Unfortunately the best known general-purpose algorithms have high-order polynomial time complexi...