628 search results - page 59 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
112
click to vote
ARCS
2006
Springer
15 years 7 months ago
2006
Springer
An n-node tree has to be explored by a group of k mobile robots deployed initially at the root. Robots traverse the edges of the tree until all nodes are visited. We would like to ...
169
Voted
ICDM
2010
IEEE
15 years 15 days ago
2010
IEEE
Community detection is an important task for mining the structure and function of complex networks. Many pervious approaches are difficult to detect communities with arbitrary size...
140
click to vote
JMLR
2010
14 years 10 months ago
2010
It is probably fair to say that exact inference in graphical models is considered a solved problem, at least regarding its computational complexity: it is exponential in the treew...
124
click to vote
PODC
2005
ACM
15 years 8 months ago
2005
ACM
The problem of verifying a Minimum Spanning Tree (MST) was introduced by Tarjan in a sequential setting. Given a graph and a tree that spans it, the algorithm is required to check...
131
click to vote
GECCO
2006
Springer
15 years 6 months ago
2006
Springer
Wire routing in a VLSI chip often requires minimization of wire-length as well as the number of intersections among multiple nets. Such an optimization problem is computationally ...