2796 search results - page 116 / 560 » The coolest path problem |
144
click to vote
FSTTCS
2009
Springer
15 years 11 months ago
2009
Springer
In this paper, we initiate the study of designing approximation algorithms for FaultTolerant Group-Steiner (FTGS) problems. The motivation is to protect the well-studied group-Ste...
141
Voted
ADHOCNOW
2008
Springer
15 years 11 months ago
2008
Springer
We study two algorithmical problems inspired from routing constraints in a multihop synchronous radio network. Our objective is to satisfy a given set of communication requests in ...
143
click to vote
DNA
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. Gene assembly in ciliates is an impressive computational process. Ciliates have a unique way of storing their genetic information in two fundamentally different forms wi...
174
Voted
NOMS
2006
IEEE
15 years 11 months ago
2006
IEEE
— Open Shortest Path First (OSPF) is a routing protocol which is widely used in the Industry. Its functionality mainly depends on the weights assigned to the links. Given the tra...
119
click to vote
SIAMJO
2002
15 years 4 months ago
2002
A probability-one homotopy algorithm for solving nonsmooth equations is described. This algorithm is able to solve problems involving highly nonlinear equations, where the norm of ...