1272 search results - page 185 / 255 » The Set Cover with Pairs Problem |
111
click to vote
DAM
2010
15 years 26 days 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...
113
Voted
STACS
2009
Springer
15 years 7 months ago
2009
Springer
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic-programming s...
108
Voted
COMPGEOM
2006
ACM
15 years 6 months ago
2006
ACM
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
94
Voted
ICCAD
1998
IEEE
15 years 5 months ago
1998
IEEE
It is known to many researchers in the partitioning community that the recursive bipartitioning approach outperforms the direct non-recursive approach in solving the multiway part...
141
Voted
FOCS
1995
IEEE
15 years 4 months ago
1995
IEEE
We consider the following maximum disjoint paths problem (mdpp). We are given a large network, and pairs of nodes that wish to communicate over paths through the network — the g...