An algorithm for realizing Euclidean distance matrices Jorge Alencar 1 Instituto Federal de Educa¸c˜ ao, Ciˆencia e Tecnologia do Sul de Minas Gerais, Inconfidentes, MG, Brazil

Source URL: www.lix.polytechnique.fr

A COMPLETE WORST-CASE ANALYSIS OF KANNAN’S SHORTEST LATTICE VECTOR ALGORITHM ´† GUILLAUME HANROT∗ AND DAMIEN STEHLE Abstract. Computing a shortest nonzero vector of a given euclidean lattice and computing a closes

Source URL: perso.ens-lyon.fr

THE EUCLIDEAN ALGORITHM IN ALGEBRAIC NUMBER FIELDS FRANZ LEMMERMEYER Abstract. This article, which is an update of a version published 1995 in Expo. Math., intends to survey what is known about Euclidean number fields;

Source URL: www.rzuser.uni-heidelberg.de

Notes on continued fractions 1. Chapter 49: The Topsy-turvy world of continued fractions First, let’s go back, way back, to the Euclidean algorithm. Let’s say for 23 and 5. If we run this through we get 23 = 4 ∗ 5

Source URL: alpha.math.uga.edu

Research Article Climbing the Steiner Tree—Sources of Active Information in a Genetic Algorithm for Solving the Euclidean Steiner Tree Problem Winston Ewert,1* William Dembski,2 Robert J. Marks II1

Source URL: robertmarks.org

Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals∗ Markus Bl¨aser1 Bodo Manthey2

Source URL: www-cc.cs.uni-saarland.de

• Mathematical analysis
• Mathematics
• Analysis
• Generalized functions
• Smooth functions
• Operations research
• Travelling salesman problem
• Distribution
• Limit of a function
• Approximation algorithm
• Convex function
• Euclidean algorithm

SMOOTH NUMBERS AND THE QUADRATIC SIEVE Carl Pomerance When faced with a large number n to factor, what do you do first? You might say “Look at the last digit,” with the idea of cheaply pulling out possible factors of

Source URL: www.mat.uniroma2.it

• Mathematics
• Integer factorization algorithms
• Number theory
• Quadratic sieve
• Special number field sieve
• Quadratic residue
• General number field sieve
• Prime number
• Lenstra elliptic curve factorization
• Sieve of Eratosthenes
• Euclidean algorithm
• Prime-counting function

Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems∗ Karl Bringmann†1 , Christian Engels2 , Bodo Manthey3 , and B. V. Raghavendra Rao4 1

Source URL: people.mpi-inf.mpg.de

• Graph theory
• Mathematics
• Computational complexity theory
• NP-hard problems
• NP-complete problems
• Edsger W. Dijkstra
• Combinatorial optimization
• Approximation algorithms
• Travelling salesman problem
• Shortest path problem
• Matching
• Randomized algorithm

Analysis of a Simple Evolutionary Algorithm for Minimization in Euclidean Spaces ¨ ¨ Jens Jagersk

Source URL: ls2-www.cs.uni-dortmund.de

• Evolutionary algorithms
• Mathematical optimization
• Mathematics
• Cybernetics
• Applied mathematics
• Numerical analysis
• Operations research
• Evolution strategy
• Minimisation
• Vector space

Optimal strategies for maintaining a chain of relays between an explorer and a base camp

Source URL: www.dcg.ethz.ch

• Algebra
• Mathematics
• Linear algebra
• Vectors
• Relays
• Power engineering
• Transducers
• Euclidean vector
• Computer
• Algorithm
• Norm
• Vector space