1158 search results - page 67 / 232 » Approximation Algorithms for the Fixed-Topology Phylogenetic... |
116
click to vote
SDM
2007
SIAM
15 years 6 months ago
2007
SIAM
We study a class of algorithms that speed up the training process of support vector machines (SVMs) by returning an approximate SVM. We focus on algorithms that reduce the size of...
138
click to vote
IPL
2008
15 years 4 months ago
2008
Max-SAT-CC is the following optimization problem: Given a formula in CNF and a bound k, find an assignment with at most k variables being set to true that maximizes the number of ...
155
click to vote
IPL
2008
15 years 4 months ago
2008
We consider the problem of computing shortest paths in three-dimensions in the presence of a single-obstacle polyhedral terrain, and present a new algorithm that for any p 1, comp...
139
click to vote
STOC
2004
ACM
16 years 5 months ago
2004
ACM
We establish several approximate max-integral-flow / minmulticut theorems. While in general this ratio can be very large, we prove strong approximation ratios in the case where th...
147
click to vote
STACS
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We present approximation algorithms for almost all variants of the multicriteria traveling salesman problem (TSP), whose performances are independent of the number k of c...