53 search results - page 3 / 11 » Greedy Algorithms for Minimisation Problems in Random Regula... |
SAC
2003
ACM
13 years 10 months ago
2003
ACM
Given a connected, weighted, undirected graph G and a bound D, the bounded-diameter minimum spanning tree problem seeks a spanning tree on G of lowest weight in which no path betw...
RSA
2002
13 years 4 months ago
2002
: The decycling number (G) of a graph G is the smallest number of vertices which can be removed from G so that the resultant graph contains no cycles. In this paper, we study the d...
AAAI
2011
12 years 5 months ago
2011
Many algorithms for performing inference in graphical models have complexity that is exponential in the treewidth - a parameter of the underlying graph structure. Computing the (m...
KDD
2010
ACM
13 years 9 months ago
2010
ACM
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
AISS
2010
13 years 2 months ago
2010
The vehicle routing problem consists in determining a group of optimal delivery routes that allow satisfaction of the demand from customers spread along a network, which can be re...