12519 search results - page 182 / 2504 » Approximation Problems Categories |
173
click to vote
DIALM
2003
ACM
15 years 11 months ago
2003
ACM
We consider the problem of maximizing the lifetime of a given multicast connection in a wireless network of energyconstrained (e.g. battery-operated) nodes, by choosing ideal tran...
182
click to vote
COMPGEOM
2008
ACM
15 years 8 months ago
2008
ACM
We consider the problem of finding a maximum number of disjoint paths for unit disks moving amidst static or dynamic obstacles. For the static case we give efficient exact algorit...
174
click to vote
SIAMJO
2000
15 years 6 months ago
2000
Abstract. We propose a BFGS primal-dual interior point method for minimizing a convex function on a convex set defined by equality and inequality constraints. The algorithm generat...
147
click to vote
CHI
2002
ACM
16 years 6 months ago
2002
ACM
We present experimental results showing that search for target items in a three-tiered categorization structure (approximately 8 links per page) is faster than a comparable two-ti...
157
click to vote
DISOPT
2006
15 years 6 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...