628 search results - page 57 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
129
click to vote
SODA
2010
ACM
16 years 16 days ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
220
click to vote
VLDB
2006
ACM
16 years 3 months ago
2006
ACM
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
132
click to vote
IPCO
2010
15 years 4 months ago
2010
Hypergraph multiway cut problem is a problem of finding a minimum capacity set of hyperedges whose removal divides a given hypergraph into a specified number of connected componen...
117
click to vote
AAAI
1990
15 years 4 months ago
1990
This paper concerns the task of removing redundant information from a given knowledge base, and restructuring it in the form of a tree, so as to admit efficient problem solving ro...
135
click to vote
GD
2006
Springer
15 years 6 months ago
2006
Springer
Given a tree T spanning a set of points S in the plane, we study the problem of drawing T using only line segments aligned with a fixed set of directions C. The vertices in the dra...