783 search results - page 24 / 157 » Improved approximation algorithms for the freeze-tag problem |
CORR
2011
Springer
13 years 3 months ago
2011
Springer
We study the problem of selecting a subset of k random variables from a large set, in order to obtain the best linear prediction of another variable of interest. This problem can ...
ICANN
2007
Springer
14 years 2 months ago
2007
Springer
Finding the largest linearly separable set of examples for a given Boolean function is a NP-hard problem, that is relevant to neural network learning algorithms and to several prob...
DISOPT
2006
13 years 8 months ago
2006
We present lower bounds for the vehicle routing problem (VRP) with and without split deliveries, improving the well known bound of Haimovich and Rinnooy Kan. These bounds are then...
SWAT
1994
Springer
14 years 21 days ago
1994
Springer
Abstract. Finding maximum independent sets in graphs with bounded maximum degree is a well-studied NP-complete problem. We introduce an algorithm schema for improving the approxim...
IPL
2006
13 years 8 months ago
2006
We present an NC approximation algorithm for the weighted matching problem in graphs with an approximation ratio of (1 - ). This improves the previously best approximation ratio of...