80 search results - page 6 / 16 » A New Approximation Algorithm for Computing 2-Restricted Dis... |
FSTTCS
2009
Springer
14 years 2 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...
COMPGEOM
1998
ACM
13 years 11 months ago
1998
ACM
We present a new technique for constructing a data-structure that approximates shortest path maps in IRd . By applying this technique, we get the following two results on approxim...
ISCC
1999
IEEE
13 years 11 months ago
1999
IEEE
Due to the wide range of services being supported, telecommunications networks are loaded with massive quantities of information. This stimulates extra concern for network surviva...
CG
2005
Springer
13 years 7 months ago
2005
Springer
We present a new algorithm to compute a geodesic path over a triangulated surface. Based on Sethian's Fast Marching Method and Polthier's Straightest Geodesics theory, w...
TON
1998
13 years 7 months ago
1998
Abstract—In this paper we consider routing and wavelength assignment in wavelength-routed all-optical networks with circuitswitching. The conventional approaches to address this ...