434 search results - page 11 / 87 » Improved Algorithms for the 2-Vertex Disjoint Paths Problem |
ISAAC
2005
Springer
15 years 5 months ago
2005
Springer
Abstract The 2-Interval Pattern problem is to find the largest constrained pattern in a set of 2-intervals. The constrained pattern is a subset of the given 2-intervals such that ...
128
click to vote
APPROX
2000
Springer
15 years 4 months ago
2000
Springer
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
83
Voted
ALGORITHMICA
2010
14 years 11 months ago
2010
T. Rado conjectured in 1928 that if S is a finite set of axis-parallel squares in the plane, then there exists an independent subset I S of pairwise disjoint squares, such that I ...
CPAIOR
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. Recently, new cost-based filtering algorithms for shorter-path constraints have been developed. However, so far only the theoretical properties of shorter-path constrain...
106
Voted
COCO
2003
Springer
15 years 4 months ago
2003
Springer
We study the communication complexity of the set disjointness problem in the general multi-party model. For t players, each holding a subset of a universe of size n, we establish ...