Results 241 to 250 of about 138,670 (265)
Some of the next articles are maybe not open access.

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

Approximate algorithms for approximate congruence

2013
We 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

On the approximation ratio of the 3-Opt algorithm for the (1,2)-TSP

Operations Research Letters, 2021
Xianghui Zhong
exaly  

Approximation Algorithms

Proceedings of the 1997 International Symposium on Parallel Architectures, Algorithms and Networks (I-SPAN'97), 2005
openaire   +2 more sources

A new approximation algorithm for the asymmetric TSP with triangle inequality

ACM Transactions on Algorithms, 2008
Markus Blaser
exaly  

A 2 + ɛ approximation algorithm for the k-MST problem

Mathematical Programming, 2005
George Karakostas   +2 more
exaly  

A novel hybrid algorithm for function approximation

Expert Systems With Applications, 2008
Zne‐Jung Lee
exaly  

Home - About - Disclaimer - Privacy