Sciweavers

632 search results - page 65 / 127
» On the Approximability of the Steiner Tree Problem
Sort
View
GECCO
2005
Springer
107views Optimization» more  GECCO 2005»
14 years 2 months ago
Minimum spanning trees made easier via multi-objective optimization
Many real-world problems are multi-objective optimization problems and evolutionary algorithms are quite successful on such problems. Since the task is to compute or approximate t...
Frank Neumann, Ingo Wegener
UAI
2001
13 years 10 months ago
Maximum Likelihood Bounded Tree-Width Markov Networks
We study the problem of projecting a distribution onto (or finding a maximum likelihood distribution among) Markov networks of bounded tree-width. By casting it as the combinatori...
Nathan Srebro
SIGMOD
2002
ACM
127views Database» more  SIGMOD 2002»
14 years 9 months ago
Approximate XML joins
XML is widely recognized as the data interchange standard for tomorrow, because of its ability to represent data from a wide variety of sources. Hence, XML is likely to be the for...
Sudipto Guha, H. V. Jagadish, Nick Koudas, Divesh ...
ICTCS
2005
Springer
14 years 2 months ago
Inapproximability Results for the Lateral Gene Transfer Problem
This paper concerns the Lateral Gene Transfer Problem. This minimization problem, defined by Hallet and Lagergren [6], is that of finding the most parsimonious lateral gene trans...
Bhaskar DasGupta, Sergio Ferrarini, Uthra Gopalakr...
INFORMS
2008
241views more  INFORMS 2008»
13 years 9 months ago
Solving the Capacitated Local Access Network Design Problem
We propose an exact solution method for a routing and capacity installation problem in networks. Given an input graph, the problem is to route traffic from a set of source nodes t...
F. Sibel Salman, R. Ravi, John N. Hooker