752 search results - page 102 / 151 » Faster approximation algorithms for the minimum latency prob... |
133
Voted
DAM
2010
15 years 3 months ago
2010
Abstract. A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time a...
129
click to vote
COMPGEOM
2006
ACM
15 years 9 months ago
2006
ACM
We study the problem of minimum-distortion embedding of ultrametrics into the plane and higher dimensional spaces. Ultrametrics are a natural class of metrics that frequently occu...
146
Voted
BIRTHDAY
2009
Springer
15 years 7 months ago
2009
Springer
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
167
click to vote
FOCS
2007
IEEE
15 years 7 months ago
2007
IEEE
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
136
click to vote
MP
2006
15 years 3 months ago
2006
Given an undirected graph G = (V;E) and three speci ed terminal nodes t1;t2;t3, a 3-cut is a subset A of E such that no two terminals are in the same component of GnA. If a non-neg...