402 search results - page 55 / 81 » A branch and cut algorithm for the Steiner problem in graphs |
STOC
2003
ACM
14 years 7 months ago
2003
ACM
In this paper, we show that any n point metric space can be embedded into a distribution over dominating tree metrics such that the expected stretch of any edge is O(log n). This ...
CORR
2011
Springer
12 years 11 months ago
2011
Springer
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...
EDBT
2009
ACM
14 years 2 months ago
2009
ACM
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...
STOC
2004
ACM
14 years 7 months ago
2004
ACM
We give a O( log n)-approximation algorithm for sparsest cut, edge expansion, balanced separator, and graph conductance problems. This improves the O(log n)-approximation of Leig...
EMMCVPR
2009
Springer
14 years 1 months ago
2009
Springer
Optimization with graph cuts became very popular in recent years. As more applications rely on graph cuts, different energy functions are being employed. Recent evaluation of optim...