628 search results - page 34 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
150
Voted
NETWORKING
2007
15 years 4 months ago
2007
Abstract. We consider the problem of constructing a proxy-based overlay skeleton tree (POST) in the backbone service domain of a two-tier overlay multicast infrastructure. Spanning...
123
Voted
CVPR
2011
IEEE
14 years 11 months ago
2011
IEEE
We present a novel framework for tree-structure embedded density estimation and its fast approximation for mode seeking. The proposed method could find diverse applications in co...
114
click to vote
ICALP
2005
Springer
15 years 8 months ago
2005
Springer
In the Euclidean group Traveling Salesman Problem (TSP), we are given a set of points P in the plane and a set of m connected regions, each containing at least one point of P. We w...
134
Voted
COLOGNETWENTE
2009
15 years 3 months ago
2009
We consider maximum properly edge-colored trees in edge-colored graphs Gc . We also consider the problem where, given a vertex r, determine whether the graph has a spanning tree r...
129
Voted
TCBB
2010
15 years 29 days ago
2010
— We explore the maximum parsimony (MP) and ancestral maximum likelihood (AML) criteria in phylogenetic tree reconstruction. Both problems are NP hard, so we seek approximate sol...