Sciweavers

2194 search results - page 14 / 439
» Improving HLRTA*( k )
Sort
View
ALGORITHMICA
2002
101views more  ALGORITHMICA 2002»
13 years 9 months ago
Improved Algorithms for Constructing Fault-Tolerant Spanners
Let S be a set of n points in a metric space, and k a positive integer. Algorithms are given that construct k-fault-tolerant spanners for S. If in such a spanner at most k vertice...
Christos Levcopoulos, Giri Narasimhan, Michiel H. ...
BC
1999
65views more  BC 1999»
13 years 9 months ago
Cooperative mechanism for improving the discriminating ability in the chemoreceptor neuron Binomial case
The discriminating ability (selectivity) of the chemoreceptor neuron is compared with that of its receptor proteins. The process of neuronal triggering is expected to be cooperativ...
Alexander K. Vidybida
ADHOCNOW
2008
Springer
14 years 4 months ago
Approximating Minimum-Power k-Connectivity
Abstract. The Minimum-Power k-Connected Subgraph (MPkCS) problem seeks a power (range) assignment to the nodes of a given wireless network such that the resulting communication (su...
Zeev Nutov
APPROX
2008
Springer
142views Algorithms» more  APPROX 2008»
13 years 12 months ago
Approximating Maximum Subgraphs without Short Cycles
We study approximation algorithms, integrality gaps, and hardness of approximation, of two problems related to cycles of "small" length k in a given graph. The instance f...
Guy Kortsarz, Michael Langberg, Zeev Nutov