5595 search results - page 117 / 1119 » Approximation Algorithms for Clustering Problems |
140
click to vote
SODA
2008
ACM
15 years 6 months ago
2008
ACM
The problem of maximizing a concave function f(x) in a simplex S can be solved approximately by a simple greedy algorithm. For given k, the algorithm can find a point x(k) on a k-...
156
click to vote
AAIM
2007
Springer
2007
Springer
Improved Approximation Algorithms for Predicting RNA Secondary Structures with Arbitrary Pseudoknots
15 years 11 months ago
We study three closely related problems motivated by the prediction of RNA secondary structures with arbitrary pseudoknots: the MAXIMUM BASE PAIR STACKINGS problem proposed by Ieon...
117
click to vote
FOCS
2003
IEEE
15 years 10 months ago
2003
IEEE
In this paper, we give the rst constant-factor approximationalgorithmfor the rooted Orienteering problem, as well as a new problem that we call the Discounted-Reward TSP, motivate...
126
click to vote
DAC
1996
ACM
15 years 9 months ago
1996
ACM
Approximation has been shown to be an eective method for reducing the time and space costs of solving various oorplan area minimization problems. In this paper, we present several...
140
click to vote
ICALP
2010
Springer
15 years 9 months ago
2010
Springer
Given a positive integer n and a positive semidefinite matrix A = (Aij ) ∈ Rm×m the positive semidefinite Grothendieck problem with rank-nconstraint is (SDPn) maximize mX i=1 ...