752 search results - page 11 / 151 » Faster approximation algorithms for the minimum latency prob... |
FOCS
2009
IEEE
14 years 1 months ago
2009
IEEE
Abstract— We give approximation algorithms for the Generalized Steiner Network (GSN) problem. The input consists of a graph
ALGORITHMICA
2004
13 years 6 months ago
2004
We consider the problem of finding a minimum diameter spanning tree with maximum node degree B in a complete undirected edge-weighted graph. We provide an O( p logB n)-approximatio...
UAI
1994
13 years 8 months ago
1994
We show how to nd a minimum weight loop cutset in a Bayesian network with high probability. Finding such a loop cutset is the rst step in the method of conditioning for inference....
APPROX
2004
Springer
14 years 3 days ago
2004
Springer
In the Minimum Common String Partition problem (MCSP) we are given two strings on input, and we wish to partition them into the same collection of substrings, minimizing the numbe...
IICAI
2003
13 years 8 months ago
2003
Minimum vertex cover problem (MVCP) is an NP-hard problem and it has numerous real life applications. This paper presents hybrid genetic algorithm (HGA) to solve MVCP efficiently. ...