666 search results - page 2 / 134 » New primal-dual algorithms for Steiner tree problems |
109
click to vote
CVPR
2011
IEEE
14 years 7 months ago
2011
IEEE
This paper presents a new adaptive graph-cut based move-making algorithm for energy minimization. Traditional move-making algorithms such as Expansion and Swap operate by searchin...
108
click to vote
JMLR
2012
13 years 2 months ago
2012
We develop scalable algorithms for regular and non-negative matrix completion. In particular, we base the methods on trace-norm regularization that induces a low rank predicted ma...
FOCS
2006
IEEE
15 years 5 months ago
2006
IEEE
In this work we study a wide range of online and offline routing and packing problems with various objectives. We provide a unified approach, based on a clean primal-dual method...
SIAMJO
2008
14 years 11 months ago
2008
We study the second-order feasibility cone F = {y IRn : My gT y} for given data (M, g). We construct a new representation for this cone and its dual based on the spectral decompo...
COR
2007
14 years 11 months ago
2007
We present new primal-dual algorithms for several network design problems. The problems considered are the generalized Steiner tree problem (GST), the directed Steiner tree proble...