7150 search results - page 417 / 1430 » An Approximation Algorithm for Approximation Rank |
154
click to vote
AAIM
2007
Springer
16 years 1 months ago
2007
Springer
The Generalized Maximum Dispersion problem asks for a partition of a given graph into p vertex-disjoint sets, each of them having at most k vertices. The goal is to maximize the to...
171
Voted
COCOON
2005
Springer
16 years 11 days ago
2005
Springer
We study the edge-connectivity survivable network design problem with an additional linear budget constraint. We give a strongly polynomial time (3, 3)-approximation algorithm for ...
160
click to vote
ISAAC
2005
Springer
16 years 10 days ago
2005
Springer
We develop exact and approximate algorithms for computing optimal separators and measuring the extent to which two point sets in d-dimensional space are separated, with respect to...
176
click to vote
CAIP
2007
Springer
15 years 11 months ago
2007
Springer
This paper reports about the development of two provably correct approximate algorithms which calculate the Euclidean shortest path (ESP) within a given cube-curve with arbitrary a...
200
click to vote
ICML
2004
IEEE
16 years 8 days ago
2004
IEEE
This paper introduces RankOpt, a linear binary classifier which optimises the area under the ROC curve (the AUC). Unlike standard binary classifiers, RankOpt adopts the AUC stat...