982 search results - page 34 / 197 » Solving Steiner tree problems in graphs to optimality |
115
click to vote
STOC
2004
ACM
16 years 25 days ago
2004
ACM
Several combinatorial optimization problems choose elements to minimize the total cost of constructing a feasible solution that satisfies requirements of clients. In the STEINER T...
126
Voted
FOCS
2008
IEEE
15 years 7 months ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
121
click to vote
CP
2010
Springer
14 years 10 months ago
2010
Springer
We introduce a parallelized version of tree-decomposition based dynamic programming for solving difficult weighted CSP instances on many cores. A tree decomposition organizes cost ...
SIAMCOMP
1998
15 years 5 days ago
1998
The inference of consensus from a set of evolutionary trees is a fundamental problem in a number of fields such as biology and historical linguistics, and many models for inferrin...
103
Voted
EOR
2006
15 years 16 days ago
2006
The robust spanning tree problem is a variation, motivated by telecommunications applications, of the classic minimum spanning tree problem. In the robust spanning tree problem ed...