7006 search results - page 91 / 1402 » Approximation Algorithms |
117
click to vote
EOR
2006
15 years 2 months ago
2006
The subject of this paper is the formulation and solution of a variation of the classical binary knapsack problem. The variation that is addressed is termed the ``fixed-charge kna...
158
click to vote
SMC
2010
IEEE
15 years 7 days ago
2010
IEEE
Abstract--Finding the longest simple path in a generic undirected graph is a challenging issue that belongs to the NPComplete class of problems. Four approaches based on genetic al...
234
Voted
ICDE
2008
IEEE
16 years 3 months ago
2008
IEEE
We study the following problem: how to efficiently find in a collection of strings those similar to a given query string? Various similarity functions can be used, such as edit dis...
106
click to vote
ICCSA
2004
Springer
15 years 7 months ago
2004
Springer
Abstract. Given a simple n-sided polygon in the plane with a boundary partitioned into subchains some of which are convex and colored, we consider the following problem: Which is t...
101
click to vote
STOC
2003
ACM
16 years 2 months ago
2003
ACM
We show how to determine whether the edit distance between two given strings is small in sublinear time. Specifically, we present a test which, given two n-character strings A and...