503 search results - page 13 / 101 » Two Algorithms for the Minimum Enclosing Ball Problem |
108
click to vote
HICSS
2005
IEEE
15 years 5 months ago
2005
IEEE
The Vehicle Routing Problem with Time Windows (VRPTW) is an important problem in logistics. The problem is to serve a number of customers at minimum cost without violating the cus...
108
click to vote
TON
2010
14 years 6 months ago
2010
Abstract--In communication networks, multiple disjoint communication paths are desirable for many applications. Such paths, however, may not exist in a network. In such a situation...
100
Voted
WG
2004
Springer
15 years 5 months ago
2004
Springer
In portable multimedia systems a number of communicating tasks has to be performed on a set of heterogeneous processors. This should be done in an energy-efficient way. We give th...
99
Voted
SODA
1994
ACM
15 years 1 months ago
1994
ACM
We maintain the maximum spanning tree of a planar point set, as points are inserted or deleted, in O(log3 n) time per update in Mulmuley's expected-case model of dynamic geom...
101
Voted
AAIM
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. Given a digraph D, the Minimum Leaf Out-Branching problem (MinLOB) is the problem of finding in D an out-branching with the minimum possible number of leaves, i.e., vert...