657 search results - page 96 / 132 » Polynomial Time Algorithms for Minimum Energy Scheduling |
PODC
2009
ACM
16 years 10 days ago
2009
ACM
In the interference scheduling problem, one is given a set of n communication requests described by pairs of points from a metric space. The points correspond to devices in a wire...
IPPS
1998
IEEE
15 years 4 months ago
1998
IEEE
We address the issue of multicasting and broadcasting in wide area WDM networks in which a source broadcasts a message to all members in S V. We formalize it as the optimal multi...
WABI
2005
Springer
15 years 5 months ago
2005
Springer
We present several new results pertaining to haplotyping. The first set of results concerns the combinatorial problem of reconstructing haplotypes from incomplete and/or imperfect...
CCCG
2010
15 years 1 months ago
2010
In this paper we present a polynomial time algorithm for computing a Hausdorff core of a polygon with a single reflex vertex. A Hausdorff core of a polygon P is a convex polygon Q...
SPAA
2003
ACM
15 years 5 months ago
2003
ACM
We consider an online version of the oblivious routing problem. Oblivious routing is the problem of picking a routing between each pair of nodes (or a set of ows), without knowled...