489 search results - page 15 / 98 » Approximation Algorithms for the Minimum-Length Corridor and... |
SODA
2008
ACM
13 years 9 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-...
AAIM
2007
Springer
2007
Springer
Improved Approximation Algorithms for Predicting RNA Secondary Structures with Arbitrary Pseudoknots
14 years 1 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...
CIAC
2010
Springer
13 years 11 months ago
2010
Springer
In this paper, we consider variants of the traveling salesman problem with precedence constraints. We characterize hard input instances for Christofides' algorithm and Hoogeve...
WADS
2005
Springer
14 years 1 months ago
2005
Springer
We present efficient approximation algorithms for a number of problems that call for computing the prices that maximize the revenue of the seller on a set of items. Algorithms for ...
ICDM
2005
IEEE
14 years 1 months ago
2005
IEEE
In order to generate synthetic basket data sets for better benchmark testing, it is important to integrate characteristics from real-life databases into the synthetic basket data ...