3192 search results - page 76 / 639 » The minimum latency problem |
FOCS
2010
IEEE
14 years 7 months ago
2010
IEEE
Given a network, a set of demands and a cost function f(
LATIN
2010
Springer
15 years 5 months ago
2010
Springer
Given a set S of segments in the plane, a polygon P is an intersecting polygon of S if every segment in S intersects the interior or the boundary of P. The problem MPIP of computi...
DAM
2006
14 years 10 months ago
2006
Let P be a combinatorial optimization problem, and let A be an approximation algorithm for P. The domination ratio domr(A, s) is the maximal real q such that the solution x(I) obt...
ESA
2009
Springer
15 years 4 months ago
2009
Springer
Dial-a-Ride problems consist of a set V of n vertices in a metric space (denoting travel time between vertices) and a set of m objects represented as source-destination pairs {(si,...
PCI
2009
Springer
15 years 2 months ago
2009
Springer
—Storage management in wireless sensor networks is an area that has started to attract significant attention, and several methods have been proposed, such as Local Storage (LS),...