192 search results - page 16 / 39 » A Constant-Factor Approximation Algorithm for the Multicommo... |
101
click to vote
ICML
2010
IEEE
15 years 3 months ago
2010
IEEE
We introduce a natural generalization of submodular set cover and exact active learning with a finite hypothesis class (query learning). We call this new problem interactive submo...
125
click to vote
DCOSS
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. We propose a distributed scheme called Adaptive-GroupMerge for sensor networks that, given a parameter k, approximates a geometric shape by a k-vertex polygon. The algori...
140
click to vote
CATS
2006
15 years 3 months ago
2006
We consider the following clustering problems: given a general undirected graph, partition its vertices into disjoint clusters such that each cluster forms a clique and the number...
113
click to vote
FOCS
2006
IEEE
15 years 8 months ago
2006
IEEE
We consider approximation algorithms for non-uniform buy-at-bulk network design problems. The first nontrivial approximation algorithm for this problem is due to Charikar and Kar...
134
click to vote
ATAL
2010
Springer
15 years 3 months ago
2010
Springer
Decentralized POMDPs provide an expressive framework for sequential multi-agent decision making. Despite their high complexity, there has been significant progress in scaling up e...