2698 search results - page 122 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
221
click to vote
ESA
2011
Springer
14 years 6 months ago
2011
Springer
In this work we study the problem of Bipartite Correlation Clustering (BCC), a natural bipartite counterpart of the well studied Correlation Clustering (CC) problem. Given a bipart...
189
click to vote
CIAC
2010
Springer
15 years 9 months ago
2010
Springer
In this paper, we consider variants of the traveling salesman problem with precedence constraints. We characterize hard input instances for Christofides' algorithm and Hoogeve...
142
click to vote
PUK
2003
15 years 7 months ago
2003
Planning is known to be a difficult task. One of the approaches used to reduce this difficulty is problem decomposition under divide-and-conquer methodology. This paper introduce...
224
click to vote
CPM
1998
Springer
15 years 10 months ago
1998
Springer
The approximate string matching problem is to find all locations at which a query of length m matches a substring of a text of length n with k-or-fewer differences. Simple and prac...
162
click to vote
IPCO
2007
15 years 7 months ago
2007
Abstract. We consider the single machine scheduling problem to minimize the average weighted completion time under precedence constrains. Improving on the various 2-approximation a...