701 search results - page 34 / 141 » An Ant Algorithm for the Steiner Tree Problem in Graphs |
145
click to vote
SIAMCOMP
2008
15 years 3 months ago
2008
We develop approximation algorithms for the problem of placing replicated data in arbitrary networks, where the nodes may both issue requests for data objects and have capacity fo...
ESA
2003
Springer
15 years 8 months ago
2003
Springer
158
Voted
IEICET
2011
14 years 10 months ago
2011
In this paper, we study the minimum spanning tree problem for vertex-labeled graphs, where the weights of edges may vary depending on the selection of labels of vertices at both e...
164
Voted
SODA
2010
ACM
16 years 20 days ago
2010
ACM
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...