17770 search results - page 220 / 3554 » A Generalization of Forward-Backward Algorithm |
161
click to vote
APPROX
2000
Springer
15 years 11 months ago
2000
Springer
We consider a fault tolerant version of the metric facility location problem in which every city, j, is required to be connected to rj facilities. We give the first non-trivial ap...
143
click to vote
SIGCSE
1999
ACM
15 years 11 months ago
1999
ACM
Algorithms have cometo be recognizedasthe cornerstone of computing. Surprisingly, there has been little research or discussion of general techniques for designing algorithms. Thou...
171
click to vote
ALGORITHMICA
2010
15 years 6 months ago
2010
We consider a high-multiplicity generalization of the classical stable matching problem known as the stable allocation problem, introduced by Ba
173
click to vote
TCS
2008
15 years 6 months ago
2008
The edge dominating set (EDS) and edge cover (EC) problems are classical graph covering problems in which one seeks a minimum cost collection of edges which covers the edges or ve...
173
click to vote
SWAT
1994
Springer
15 years 10 months ago
1994
Springer
We present sequential and parallel algorithms for various embedding problems on bounded degree partial k-trees and k-connected partial k-trees these include subgraph isomorphism a...