1941 search results - page 5 / 389 » On Generalizations of Network Design Problems with Degree Bo... |
152
click to vote
FOCS
2006
IEEE
15 years 11 months ago
2006
IEEE
We consider the minimum cost spanning tree problem under the restriction that all degrees must be at most a given value k. We show that we can efficiently find a spanning tree o...
145
click to vote
IJCNN
2000
IEEE
15 years 10 months ago
2000
IEEE
The generalized maze problem has been considered as an interesting testbed by various researchers in AI and neural networks. The most significantresults, fiom a neural networks po...
136
click to vote
JAIR
1998
15 years 5 months ago
1998
Using an improved backtrack algorithm with sophisticated pruning techniques, we revise previous observations correlating a high frequency of hard to solve Hamiltonian cycle instan...
170
click to vote
ECCC
2000
15 years 5 months ago
2000
We analyze the addition of a simple local improvement step to various known randomized approximation algorithms. Let ' 0:87856 denote the best approximation ratio currently k...
154
click to vote
STOC
2001
ACM
16 years 6 months ago
2001
ACM
Consider a setting in which a group of nodes, situated in a large underlying network, wishes to reserve bandwidth on which to support communication. Virtual private networks (VPNs...