402 search results - page 69 / 81 » A branch and cut algorithm for the Steiner problem in graphs |
APPROX
2009
Springer
14 years 1 months ago
2009
Springer
Submodular-function maximization is a central problem in combinatorial optimization, generalizing many important NP-hard problems including Max Cut in digraphs, graphs and hypergr...
FOCS
1997
IEEE
13 years 11 months ago
1997
IEEE
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...
MM
2010
ACM
13 years 7 months ago
2010
ACM
This paper presents a method to render artistic paper-cut of human portraits. Rendering paper-cut images from photographs can be considered as an inhomogeneous image binarization ...
JMLR
2010
13 years 2 months ago
2010
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...
JACM
2007
13 years 7 months ago
2007
We consider the problem of finding a shortest cycle (freely) homotopic to a given simple cycle on a compact, orientable surface. For this purpose, we use a pants decomposition of...