642 search results - page 59 / 129 » Approximation Algorithms for Minimum K-Cut |
107
click to vote
APPROX
2011
Springer
13 years 12 months ago
2011
Springer
Abstract. We study the space complexity of randomized streaming algorithms that provide one-sided approximation guarantees; e.g., the algorithm always returns an overestimate of th...
VTC
2006
IEEE
15 years 5 months ago
2006
IEEE
We study the problem of minimum energy cooperative path (MECP) routing in wireless networks. The joint problem of cooperative routing in wireless networks that combines route sele...
116
click to vote
FOCS
2008
IEEE
15 years 6 months ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
102
click to vote
ICML
2010
IEEE
15 years 27 days ago
2010
IEEE
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
118
click to vote
ISAAC
2005
Springer
15 years 5 months ago
2005
Springer
In this paper, we deal with both the complexity and the approximability of the labeled perfect matching problem in bipartite graphs. Given a simple graph G = (V, E) with n vertices...