50 search results - page 4 / 10 » Analysis of Approximation Algorithms for k-Set Cover Using F... |
AAIM
2009
Springer
14 years 17 days ago
2009
Springer
Polyhedra are widely used in model checking and abstract interpretation. Polyhedral analysis is effective when the relationships between variables are linear, but suffers from im...
POPL
2003
ACM
14 years 6 months ago
2003
ACM
We show how to efficiently obtain linear a priori bounds on the heap space consumption of first-order functional programs. The analysis takes space reuse by explicit deallocation ...
FOGA
2011
12 years 9 months ago
2011
The distribution of fitness values across a set of states sharply influences the dynamics of evolutionary processes and heuristic search in combinatorial optimization. In this p...
STACS
2005
Springer
13 years 11 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 ...
SODA
2010
ACM
14 years 3 months ago
2010
ACM
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...