1272 search results - page 98 / 255 » The Set Cover with Pairs Problem |
89
Voted
ICC
2007
IEEE
15 years 7 months ago
2007
IEEE
— Assume the reliability of a connection is determined by the number of distinct risks associated with the path. We study the most reliable routing for WDM networks with arbitrar...
171
Voted
CAD
2011
Springer
14 years 7 months ago
2011
Springer
The problem of computing the minimum enclosing sphere (MES) of a point set is a classical problem in Computational Geometry. As an LP-type problem, its expected running time on th...
107
Voted
RECOMB
2006
Springer
16 years 1 months ago
2006
Springer
Inferring orthologous and paralogous genes is an important problem in whole genomes comparisons, both for functional or evolutionary studies. In this paper, we introduce a new appr...
116
click to vote
SIAMCOMP
2000
15 years 17 days ago
2000
There are several results available in the literature dealing with efficient construction of t-spanners for a given set S of n points in Rd. t-spanners are Euclidean graphs in whic...
EJC
2007
15 years 23 days ago
2007
We prove that the translation plane and the shift plane defined by a planar partition function form an oval pair of projective planes in the sense that the planes share a line pe...