3874 search results - page 124 / 775 » Approximation Algorithms for k-hurdle Problems |
142
click to vote
IPL
2000
15 years 1 months ago
2000
We combine two known polynomial time approximation algorithms for the maximum traveling salesman problem to obtain a randomized algorithm which outputs a solution with expected va...
132
Voted
CORR
2011
Springer
14 years 5 months ago
2011
Springer
A hitting set for a collection of sets is a set that has a nonempty intersection with each set in the collection; the hitting set problem is to find a hitting set of minimum card...
104
click to vote
PODS
2010
ACM
15 years 6 months ago
2010
ACM
We give the first optimal algorithm for estimating the number of distinct elements in a data stream, closing a long line of theoretical research on this problem begun by Flajolet...
109
click to vote
EOR
2007
15 years 1 months ago
2007
In this paper, we study the procurement problem faced by a buyer who needs to purchase a variety of goods from suppliers applying a so-called total quantity discount policy. This ...
117
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Artificial neural networks (ANNs) have been successfully applied to solve a variety of classification and function approximation problems. Although ANNs can generally predict bett...