261 search results - page 34 / 53 » A randomized polynomial-time simplex algorithm for linear pr... |
ACTA
2006
14 years 11 months ago
2006
Abstract Selectivity estimation of a boolean query based on frequent itemsets can be solved by describing the problem by a linear program. However, the number of variables in the e...
STACS
2005
Springer
15 years 5 months ago
2005
Springer
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...
MP
1998
14 years 11 months ago
1998
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
IPPS
2009
IEEE
15 years 6 months ago
2009
IEEE
In this paper, we explore the problem of mapping filtering services on large-scale heterogeneous platforms. Two important optimization criteria should be considered in such a fra...
APPROX
2009
Springer
15 years 6 months ago
2009
Springer
We study the maximization version of the fundamental graph coloring problem. Here the goal is to color the vertices of a k-colorable graph with k colors so that a maximum fraction ...