4114 search results - page 5 / 823 » Efficient Algorithms for the 2-Center Problems |
142
click to vote
JALC
2002
15 years 2 months ago
2002
We define general algebraic frameworks for shortest-distance problems based on the structure of semirings. We give a generic algorithm for finding single-source shortest distances...
118
Voted
IAJIT
2010
15 years 1 months ago
2010
: In this paper, a quantum-inspired differential evolution algorithm for solving the N-queens problem is presented. The N-queens problem aims at placing N queens on an NxN chessboa...
105
click to vote
CORR
2010
Springer
15 years 17 days ago
2010
Springer
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given a...
118
click to vote
SIAMJO
2000
15 years 2 months ago
2000
We study the problem of minimizing a sum of p-norms where p is a fixed real number in the interval [1, ]. Several practical algorithms have been proposed to solve this problem. How...
141
click to vote
HIS
2009
15 years 28 days ago
2009
Abstract--The generalized minimum vertex-biconnected network problem plays an important role in the design of survivable backbone networks that should be fault tolerant to single c...