Results 251 to 260 of about 1,003,970 (287)
Some of the next articles are maybe not open access.
Approximate decision algorithms for approximate congruence
Information Processing Letters, 1992We derive a \(({1\over 2} \varepsilon_{opt}(A,B), \varepsilon_{opt}(A,B))\)-approximate algorithm for approximate congruence by translations with running time \(O(n^{2.5})\) and a \(({1\over 2},\varepsilon_{opt}(A,B) \varepsilon_{opt}(A,B))\)- approximate algorithm with running time \(O(n^ 4)\) for the general case.
openaire +2 more sources
Algorithms for approximate FSM traversal
Proceedings of the 30th international on Design automation conference - DAC '93, 1993In this paper we present algorithms for approximate FSM traversal based on state space decomposition. The original FSM is partitioned in sub-machines, and each of them is traversed separately; the result is an over-estimation of the set of reachable states. Several traversal strategies are discussed.
CHO H +4 more
openaire +1 more source
Greedy in Approximation Algorithms
2006The objective of this paper is to characterize classes of problems for which a greedy algorithm finds solutions provably close to optimum. To that end, we introduce the notion of k-extendible systems, a natural generalization of matroids, and show that a greedy algorithm is a 1/k-factor approximation for these systems.
openaire +1 more source
Fast Algorithms for Approximating Distances
Algorithmica, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sergei Bespamyatnikh, Michael Segal 0001
openaire +1 more source
Approximate Traveling Salesman Algorithms
Operations Research, 1980There have been a multitude of heuristic algorithms proposed for the solution of large scale traveling salesman problems. Our intent in this paper is to examine some of these well known heuristics, to introduce some new heuristics, and to compare these approximate techniques on the basis of efficiency and accuracy.
Bruce L. Golden +3 more
openaire +1 more source
Approximate algorithms for approximate congruence
2013We study the decision problem whether two sets of n points in the plane are approximately congruent with a given tolerance \varepsilon. Approximate algorithm means that the algorithm is not guaranteed to take a decision for all tolerance values.
openaire +1 more source
Dynamic Algorithms for Approximating Interdistances
2003Summary: We present efficient dynamic algorithms for approximation of \(k\)th, \(1\leq k\leq{n\choose 2}\) distance defined by some pair of points from a given set \(S\) of \(n\) points in \(d\)-dimensional space. Our technique is based on the dynamization of well-separated pair decomposition proposed in [\textit{P. B. Callahan} and \textit{S.
Sergei Bespamyatnikh, Michael Segal 0001
openaire +2 more sources
On the approximation ratio of the 3-Opt algorithm for the (1,2)-TSP
Operations Research Letters, 2021Xianghui Zhong
exaly
Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (I-SPAN'97), 2005
openaire +2 more sources
openaire +2 more sources