1158 search results - page 59 / 232 » Approximation Algorithms for the Fixed-Topology Phylogenetic... |
172
click to vote
SIAMCOMP
1998
15 years 4 months ago
1998
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
130
click to vote
WADS
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We give processor-allocation algorithms for grid architectures, where the objective is to select processors from a set of available processors to minimize the average num...
145
Voted
ADHOCNOW
2008
Springer
15 years 11 months ago
2008
Springer
We present 1 − approximation algorithms for the maximum matching problem in location aware unit disc graphs and in growth-bounded graphs. The algorithm for unit disk graph is loc...
129
click to vote
ICCAD
2001
IEEE
16 years 1 months ago
2001
IEEE
More aggressive design practices have created renewed interest in techniques for analyzing substrate coupling problems. Most previous work has focused primarily on faster techniqu...
184
click to vote
COMGEO
2012
ACM
14 years 11 days ago
2012
ACM
We study a class of multi-commodity flow problems in geometric domains: For a given planar domain P populated with obstacles (holes) of K ≥ 2 types, compute a set of thick path...