496 search results - page 6 / 100 » A Polynomial-Time Approximation Algorithm for a Geometric Di... |
117
Voted
STACS
2010
Springer
15 years 9 months ago
2010
Springer
We present two new approximation algorithms with (improved) constant ratios for selecting n points in n unit disks such that the minimum pairwise distance among the points is maxi...
117
click to vote
ICALP
2010
Springer
15 years 7 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 ...
138
Voted
STOC
2000
ACM
15 years 6 months ago
2000
ACM
Multiple sequence alignment is a fundamental problem in computational biology. Because of its notorious difficulties, aligning sequences within a constant band (c-diagonal) is a ...
136
click to vote
FOCS
2006
IEEE
15 years 8 months ago
2006
IEEE
How much can randomness help computation? Motivated by this general question and by volume computation, one of the few instances where randomness provably helps, we analyze a noti...
127
click to vote
STOC
2005
ACM
15 years 8 months ago
2005
ACM
We present an asymptotic fully polynomial time approximation scheme for two-dimensional strip packing with rotations. In this problem, a set of rectangles need to be packed into a...