31 search results - page 5 / 7 » Approximability of Combinatorial Problems with Multi-agent S... |
131
click to vote
APPROX
2009
Springer
15 years 10 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 ...
145
click to vote
APPROX
2010
Springer
15 years 4 months ago
2010
Springer
We consider optimization problems that can be formulated as minimizing the cost of a feasible solution wT x over an arbitrary combinatorial feasible set F {0, 1}n . For these pro...
152
Voted
JMLR
2008
15 years 3 months ago
2008
When monitoring spatial phenomena, which can often be modeled as Gaussian processes (GPs), choosing sensor locations is a fundamental task. There are several common strategies to ...
220
click to vote
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
Correlation Clustering was defined by Bansal, Blum, and Chawla as the problem of clustering a set of elements based on a possibly inconsistent binary similarity function between e...
126
Voted
IPCO
2010
15 years 4 months ago
2010
In the Steiner Network problem we are given a graph with edge-costs and connectivity requirements between node pairs , . The goal is to find a minimum-cost subgraph of that contain...