982 search results - page 98 / 197 » Solving Steiner tree problems in graphs to optimality |
111
Voted
IPCO
2008
15 years 2 months ago
2008
Orbital branching is a method for branching on variables in integer programming that reduces the likelihood of evaluating redundant, isomorphic nodes in the branch-and-bound proce...
86
Voted
SODA
2004
ACM
15 years 2 months ago
2004
ACM
The inference of evolutionary trees using approaches which attempt to solve the maximum parsimony (MP) and maximum likelihood (ML) optimization problems is a standard part of much...
124
Voted
SPAA
2004
ACM
15 years 6 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
116
Voted
PPAM
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorit...
125
Voted
COLOGNETWENTE
2010
14 years 9 months ago
2010
Given a bipartite graph G = (S, T, E), we consider the problem of finding k bipartite subgraphs, called "clusters", such that each vertex i of S appears in exactly one o...