7129 search results - page 713 / 1426 » Approximation Algorithms for Treewidth |
197
click to vote
EOR
2008
15 years 7 months ago
2008
This article describes and compares three heuristics for a variant of the Steiner tree problem with revenues, which includes budget and hop constraints. First, a greedy method whi...
189
Voted
CORR
2007
Springer
15 years 7 months ago
2007
Springer
The k-forest problem is a common generalization of both the k-MST and the dense-k-subgraph problems. Formally, given a metric space on n vertices V , with m demand pairs ⊆ V × ...
202
click to vote
ML
2008
ACM
15 years 7 months ago
2008
ACM
Abstract. We consider a large volume principle for transductive learning that prioritizes the transductive equivalence classes according to the volume they occupy in hypothesis spa...
198
click to vote
PE
2006
Springer
15 years 7 months ago
2006
Springer
Approximating general distributions by phase-type (PH) distributions is a popular technique in stochastic analysis, since the Markovian property of PH distributions often allows a...
191
click to vote
ALIFE
2002
15 years 7 months ago
2002
In this paper, we study the relationship between the two techniques known as ant colony optimization (aco) and stochastic gradient descent. More precisely, we show that some empir...