10 search results - page 1 / 2 » Tree-Approximations for the Weighted Cost-Distance Problem |
ISAAC
2001
Springer
14 years 3 months ago
2001
Springer
SODA
2000
ACM
14 years 7 days ago
2000
ACM
The Steiner tree problem in weighted graphs seeks a minimum weight connected subgraph containing a given subset of the vertices terminals. We present a new polynomial-time heurist...
ICDE
2009
IEEE
14 years 5 months ago
2009
IEEE
— Large graphs and networks are abundant in modern information systems: entity-relationship graphs over relational data or Web-extracted entities, biological networks, social onl...
IPL
1998
13 years 10 months ago
1998
The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum Spanning Tree has least weight amongst all subsets of at least k vertices. Th...
ISITA
2010
13 years 8 months ago
2010
Abstract--Chow and Liu considered the problem of approximating discrete joint distributions with dependence tree distributions where the goodness of the approximations were measure...