Results 281 to 290 of about 129,306 (313)

Fast Algorithms for Approximating Distances

Algorithmica, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sergei Bespamyatnikh, Michael Segal 0001
openaire   +1 more source

An Algorithm for Approximate Tandem Repeats

Journal of Computational Biology, 2001
A perfect single tandem repeat is defined as a nonempty string that can be divided into two identical substrings, e.g., abcabc. An approximate single tandem repeat is one in which the substrings are similar, but not identical, e.g., abcdaacd. In this paper we consider two criterions of similarity: the Hamming distance (k mismatches) and the edit ...
Gad M. Landau, Jeanette P. Schmidt, Dina Sokol   +2 more
openaire   +2 more sources

Approximate Traveling Salesman Algorithms

Operations Research, 1980
There 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, Lawrence Bodin, T. Doyle, W. Stewart Jr.   +3 more
openaire   +1 more source

Approximation Algorithms in Batch Processing

Journal of Combinatorial Optimization, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Xiaotie Deng, Chung Keung Poon, Yuzhong Zhang   +2 more
openaire   +2 more sources

Greedy in Approximation Algorithms

2006
The 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

Dynamic Algorithms for Approximating Interdistances

2003
Summary: 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

Approximation Algorithms for Quadratic Programming

Journal of Combinatorial Optimization, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Minyue Fu 0001, Zhi-Quan Luo, Yinyu Ye 0001   +2 more
openaire   +2 more sources

Approximation Algorithms for the Achromatic Number

Journal of Algorithms, 2001
Summary: The achromatic number for a graph \(G=\langle V,E \rangle\) is the largest integer \(m\) such that there is a partition of \(V\) into disjoint independent sets \(V_1,\dots,V_m\) such that for each pair of distinct sets \(V_i\), \(V_j\), \(V_i\cup V_j\) is not an independent set in \textit{G. M. Yannakakis} and \textit{F. Gavril} [SIAM J. Appl.
CHAUDHARY, A, VISHWANATHAN, S
openaire   +3 more sources

Approximation algorithms for graph augmentation

Journal of Algorithms, 1992
Summary: The problem of increasing both edge and vertex connectivity of a graph at an optimal cost is studied. Since the general problem is NP-hard, we focus on efficient approximation schemes that come within a constant factor from the optimal. Previous algorithms either do not take edge costs into consideration, or they run slower than our algorithm.
Samir Khuller, Ramakrishna Thurimella
openaire   +2 more sources

Approximation Algorithms for Dispersion Problems

Journal of Algorithms, 2001
Summary: Dispersion problems involve arranging a set of points as far away from each other as possible. They have numerous applications in the location of facilities and in management decision science. We suggest a simple formalism that lets us describe different dispersal problems in a uniform way.
Barun Chandra, Magnús M. Halldórsson
openaire   +2 more sources