306 search results - page 27 / 62 » Parallel approximation algorithms for facility-location prob... |
171
click to vote
PDCAT
2005
Springer
15 years 9 months ago
2005
Springer
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
130
click to vote
IPPS
2002
IEEE
15 years 8 months ago
2002
IEEE
As the E-Commerce rapidly grows up, searching data is almost necessary in every application. Approximate string matching problems play a very important role to search with errors....
122
click to vote
PPDP
2005
Springer
15 years 9 months ago
2005
Springer
The paper describes a constraint-based solution to the protein folding problem on face-centered cubic lattices—a biologically meaningful approximation of the general protein fol...
123
click to vote
ISCAS
2005
IEEE
15 years 9 months ago
2005
IEEE
— Simulated Evolution (SimE) is a sound stochastic approximation algorithm based on the principles of adaptation. If properly engineered it is possible for SimE to reach nearopti...
168
Voted
PARA
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. This paper presents new efficient parallel algorithms for finding approximate solutions to graph coloring problems. We consider an existing shared memory parallel graph...