12519 search results - page 171 / 2504 » Approximation Problems Categories |
187
click to vote
AAIM
2006
Springer
16 years 13 days ago
2006
Springer
We study the subsequence packing problem: given a string T and a collection of strings {Si}, find disjoint subsequences {Ti} of T with maximum total length such that each Ti is a ...
146
click to vote
FOCS
1999
IEEE
15 years 10 months ago
1999
IEEE
The metric 2-clustering problem is de ned as follows: given a metric (X;d), partition X into two sets S1 and S2 in order to minimize the value of X i X fu;vg Si d(u;v) In this pap...
157
click to vote
FOCS
1995
IEEE
15 years 10 months ago
1995
IEEE
We consider the special case of the traveling salesman problem TSP in which the distance metric is the shortest-path metric of a planar unweighted graph. We present a polynomial...
143
click to vote
TC
2008
15 years 6 months ago
2008
In this paper, the problem of finding good wordlength combinations for fixed-point digital signal processing flowgraphs is addressed. By formulating and solving an approximate opti...
159
click to vote
COMBINATORICS
2007
15 years 6 months ago
2007
In the last decade there has been an ongoing interest in string comparison problems; to a large extend the interest was stimulated by genome rearrangement problems in computationa...