12825 search results - page 302 / 2565 » Improved PLSOM algorithm |
176
click to vote
DISOPT
2006
15 years 7 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...
194
click to vote
NETWORKS
2008
15 years 7 months ago
2008
We present a new efficient approach for solving the multicommodity flow problem as a sequence of subproblems, each on a very sparse but connected network. We show that each subpro...
202
click to vote
BMCBI
2007
15 years 7 months ago
2007
Background: We investigate the empirical complexity of the RNA secondary structure design problem, that is, the scaling of the typical difficulty of the design task for various cl...
215
click to vote
ISMB
1994
15 years 8 months ago
1994
A new version of the GRAIL system (Uberbacher and Mural, 1991; Mural et al., 1992; Uberbacher et al., 1993), called GRAILII, has recently been developed (Xu et al., 1994). GRAILII...
156
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
We provide an O(log log OPT)-approximation algorithm for the problem of guarding a simple polygon with guards on the perimeter. We first design a polynomial-time algorithm for bui...