1272 search results - page 97 / 255 » The Set Cover with Pairs Problem |
103
click to vote
ICLP
1997
Springer
15 years 5 months ago
1997
Springer
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
105
Voted
SPIRE
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. A set of sequences S is pairwise bounded if the Hamming distance between any pair of sequences in S is at most 2d. The Consensus Sequence problem aims to discern between ...
103
Voted
CIAC
2010
Springer
15 years 4 months ago
2010
Springer
Various forms of multicut problems are of great importance in the area of network design. In general, these problems are intractable. However, several parameters have been identifi...
99
Voted
IJCGA
2008
15 years 25 days ago
2008
Given a set P of points (clients) in the plane, a Euclidean 2-centre of P is a set of two points (facilities) in the plane such that the maximum distance from any client to its ne...
125
Voted
ALGORITHMICA
2011
14 years 7 months ago
2011
Let V be a set of points in a d-dimensional lp-metric space. Let s, t ∈ V and let L be any real number. An L-bounded leg path from s to t is an ordered set of points which conne...