727 search results - page 6 / 146 » Private approximation of search problems |
IJKESDP
2010
14 years 10 months ago
2010
—This paper considers k-minimum spanning tree problems. An existing solution algorithm based on tabu search, which was proposed by Katagiri et al., includes an iterative solving ...
105
Voted
NETWORKS
2008
14 years 11 months ago
2008
SIAMDM
2008
14 years 11 months ago
2008
67
Voted
JDA
2010
14 years 10 months ago
2010
112
Voted
ICALP
2010
Springer
15 years 4 months ago
2010
Springer
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...