272 search results - page 26 / 55 » An Approximation Algorithm for a Bottleneck Traveling Salesm... |
129
Voted
FOCS
2006
IEEE
15 years 9 months ago
2006
IEEE
d abstract] Robert Krauthgamer ∗ IBM Almaden James R. Lee † Institute for Advanced Study We initiate the study of approximate algorithms on negatively curved spaces. These spa...
180
Voted
ANTSW
2004
Springer
15 years 9 months ago
2004
Springer
A general-purpose, simulation-based algorithm S-ACO for solving stochastic combinatorial optimization problems by means of the ant colony optimization (ACO) paradigm is investigate...
113
click to vote
JDA
2006
15 years 3 months ago
2006
We consider the asymmetric traveling salesperson problem with -parameterized triangle inequality for [1/2, 1). That means, the edge weights fulfill w(u, v)
131
Voted
HM
2009
Springer
15 years 8 months ago
2009
Springer
We present a hybrid solver (called GELATO) that exploits the potentiality of a Constraint Programming (CP) environment (Gecode) and of a Local Search (LS) framework (EasyLocal++ )....
124
Voted
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
Computation in biology and in conventional computer architectures seem to share some features, yet many of their important characteristics are very different. To address this, [1]...