7129 search results - page 515 / 1426 » Approximation Algorithms for Treewidth |
196
click to vote
SIAMCOMP
2010
15 years 5 months ago
2010
Abstract. We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as pos...
244
click to vote
JMLR
2012
13 years 9 months ago
2012
We present an algorithm for fast posterior inference in penalized high-dimensional state-space models, suitable in the case where a few measurements are taken in each time step. W...
217
Voted
KDD
2012
ACM
13 years 9 months ago
2012
ACM
In order to minimize redundancy and optimize coverage of multiple user interests, search engines and recommender systems aim to diversify their set of results. To date, these dive...
190
click to vote
STACS
2010
Springer
16 years 2 months ago
2010
Springer
We revisit several maximization problems for geometric networks design under the non-crossing constraint, first studied by Alon, Rajagopalan and Suri (ACM Symposium on Computation...