1272 search results - page 87 / 255 » The Set Cover with Pairs Problem |
ISMB
1997
15 years 2 months ago
1997
Anewheuristic algorithm is presented for mapping probes to locations along the genome,given noisy pairwise distance data as input. Themodel consideredis quite general: Theinput co...
100
click to vote
STACS
2001
Springer
15 years 5 months ago
2001
Springer
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
106
Voted
INFOCOM
2003
IEEE
15 years 6 months ago
2003
IEEE
Abstract – In this paper, we develop failure-resilient techniques for monitoring link delays and faults in a Service Provider or Enterprise IP network. Our two-phased approach at...
104
click to vote
TAMC
2007
Springer
15 years 7 months ago
2007
Springer
Abstract. Kernelizations are an important tool in designing fixed parameter algorithms for parameterized decision problems. We introduce an analogous notion for counting problems,...
115
Voted
SIROCCO
2004
15 years 2 months ago
2004
The problem of routing traffic through a congested network is studied. The framework is that introduced by Koutsoupias and Papadimitriou where the network is constituted by m paral...