3875 search results - page 174 / 775 » Approximation algorithms for the 0-extension problem |
159
click to vote
AGI
2008
15 years 6 months ago
2008
Universal induction solves in principle the problem of choosing a prior to achieve optimal inductive inference. The AIXI theory, which combines control theory and universal induct...
119
click to vote
DAGSTUHL
2007
15 years 6 months ago
2007
We consider the problems of set partitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost function is given by an oracle, and we ...
116
click to vote
STOC
2002
ACM
16 years 5 months ago
2002
ACM
In this paper, we show that for several clustering problems one can extract a small set of points, so that using those core-sets enable us to perform approximate clustering effici...
158
click to vote
SIAMCOMP
2010
15 years 3 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...
154
Voted
SODA
1992
ACM
15 years 6 months ago
1992
ACM
We show that the length of the minimum weight Steiner triangulation (MWST) of a point set can be approximated within a constant factor by a triangulation algorithm based on quadtr...