36 search results - page 5 / 8 » Approximation Algorithms for Multicommodity-Type Problems wi... |
156
Voted
NIPS
2007
15 years 5 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
143
click to vote
SODA
2012
ACM
13 years 6 months ago
2012
ACM
The Odd Cycle Transversal problem (OCT) asks whether a given graph can be made bipartite by deleting at most k of its vertices. In a breakthrough result Reed, Smith, and Vetta (Op...
131
click to vote
ICALP
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. In this paper we present a novel analysis of a random sampling approach for three clustering problems in metric spaces: k-median, min-sum kclustering, and balanced k-medi...
149
click to vote
WEA
2007
Springer
15 years 10 months ago
2007
Springer
For trunk packing problems only few approximation schemes are known, mostly designed for the European standard DIN 70020 [6] with equally sized boxes [8, 9, 11, 12]. In this paper ...
145
click to vote
STOC
2006
ACM
16 years 4 months ago
2006
ACM
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...