36 search results - page 5 / 8 » Symmetry and Approximability of Submodular Maximization Prob... |
SODA
2010
ACM
15 years 7 months ago
2010
ACM
If a two-player social welfare maximization problem does not admit a PTAS, we prove that any maximal-in-range truthful mechanism that runs in polynomial time cannot achieve an app...
SODA
2010
ACM
15 years 7 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
105
click to vote
KDD
2003
ACM
15 years 10 months ago
2003
ACM
Models for the processes by which ideas and influence propagate through a social network have been studied in a number of domains, including the diffusion of medical and technolog...
APPROX
2009
Springer
15 years 4 months ago
2009
Springer
An important research thread in algorithmic game theory studies the design of efficient truthful mechanisms that approximate the optimal social welfare. A fundamental question is ...
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
Given an undirected hypergraph and a subset of vertices S ⊆ V with a specified root vertex r ∈ S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the...