-
1
-
-
0023247786
-
Geometric applications of a matrix-searching algorithm
-
A. Aggarwal, M.M. Klawe, S. Moran, P. Shor, and R. Wilber Geometric applications of a matrix-searching algorithm Algorithmica 2 1987 195 208
-
(1987)
Algorithmica
, vol.2
, pp. 195-208
-
-
Aggarwal, A.1
Klawe, M.M.2
Moran, S.3
Shor, P.4
Wilber, R.5
-
2
-
-
0022122146
-
Maximizing a supermodular pseudo-Boolean function: A polynomial algorithm for supermodular cubic functions
-
A. Billionnet, and M. Minoux Maximizing a supermodular pseudo-Boolean function: a polynomial algorithm for supermodular cubic functions Discrete Applied Mathematics 12 1 1985 1 11
-
(1985)
Discrete Applied Mathematics
, vol.12
, Issue.1
, pp. 1-11
-
-
Billionnet, A.1
Minoux, M.2
-
3
-
-
4344598245
-
An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision
-
Y. Boykov, and V. Kolmogorov An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision IEEE Transactions on Pattern Analysis and Machine Intelligence 23 11 2004 1124 1137
-
(2004)
IEEE Transactions on Pattern Analysis and Machine Intelligence
, vol.23
, Issue.11
, pp. 1124-1137
-
-
Boykov, Y.1
Kolmogorov, V.2
-
5
-
-
51949119384
-
Minimization of locally defined submodular functions by optimal soft arc consistency
-
Martin C. Cooper Minimization of locally defined submodular functions by optimal soft arc consistency Constraints 13 4 2008 437 458
-
(2008)
Constraints
, vol.13
, Issue.4
, pp. 437-458
-
-
Cooper, M.C.1
-
7
-
-
0002167079
-
Submodular functions, matroids, and certain polyhedra
-
R. Guy, H. Hanani, N. Sauer, J. Schönheim, Gordon and Breach
-
J. Edmonds Submodular functions, matroids, and certain polyhedra R. Guy, H. Hanani, N. Sauer, J. Schönheim, Combinatorial Structures and their Applications vol. 17 1970 Gordon and Breach 69 87
-
(1970)
Combinatorial Structures and Their Applications
, vol.17 VOL.
, pp. 69-87
-
-
Edmonds, J.1
-
8
-
-
0001034606
-
A min-max relation for submodular functions on graphs
-
Jack Edmonds, and Rick Giles A min-max relation for submodular functions on graphs Annals of Discrete Mathematics 1 1977 185 204
-
(1977)
Annals of Discrete Mathematics
, vol.1
, pp. 185-204
-
-
Edmonds, J.1
Giles, R.2
-
13
-
-
0041596835
-
Minimizing a submodular function arising from a concave function
-
S. Fujishige, and S. Iwata Minimizing a submodular function arising from a concave function Discrete Applied Mathematics 92 2-3 1999 211 215
-
(1999)
Discrete Applied Mathematics
, vol.92
, Issue.23
, pp. 211-215
-
-
Fujishige, S.1
Iwata, S.2
-
16
-
-
0032157143
-
Beyond the flow decomposition barrier
-
Andrew V. Goldberg, and Satish Rao Beyond the flow decomposition barrier Journal of the ACM 45 5 1998 783 797
-
(1998)
Journal of the ACM
, vol.45
, Issue.5
, pp. 783-797
-
-
Goldberg, A.V.1
Rao, S.2
-
17
-
-
77953213168
-
An efficient algorithm for co-segmentation
-
Dorit S. Hochbaum, Vikas Singh, An efficient algorithm for co-segmentation, in: ICCV, 2009, pp. 269-276.
-
(2009)
ICCV
, pp. 269-276
-
-
Dorit, S.H.1
Singh, V.2
-
18
-
-
0141534137
-
A faster scaling algorithm for minimizing submodular functions
-
S. Iwata A faster scaling algorithm for minimizing submodular functions SIAM Journal on Computing 32 4 2003 833 840
-
(2003)
SIAM Journal on Computing
, vol.32
, Issue.4
, pp. 833-840
-
-
Iwata, S.1
-
19
-
-
0008694731
-
A capacity scaling algorithm for convex cost submodular flows
-
S. Iwata A capacity scaling algorithm for convex cost submodular flows Mathematical Programming 76 2 1997 299 308
-
(1997)
Mathematical Programming
, vol.76
, Issue.2
, pp. 299-308
-
-
Iwata, S.1
-
20
-
-
70349105907
-
A simple combinatorial algorithm for submodular function minimization
-
Satoru Iwata, James B. Orlin, A simple combinatorial algorithm for submodular function minimization, SODA. 2009, pp. 1230-1237.
-
(2009)
SODA
, pp. 1230-1237
-
-
Iwata, S.1
James, B.O.2
-
24
-
-
84856105084
-
Minimizing a sum of submodular functions
-
June
-
Vladimir Kolmogorov, Minimizing a sum of submodular functions, Tech. Rep., June 2010. arXiv:1006.1990v1.
-
(2010)
Tech. Rep.
-
-
Kolmogorov, V.1
-
25
-
-
58149485960
-
A faster strongly polynomial time algorithm for submodular function minimization
-
James B. Orlin A faster strongly polynomial time algorithm for submodular function minimization Mathematical Programming 118 2 2009 237 251
-
(2009)
Mathematical Programming
, vol.118
, Issue.2
, pp. 237-251
-
-
Orlin, J.B.1
-
26
-
-
0002836025
-
Minimizing symmetric submodular functions
-
Maurice Queyranne Minimizing symmetric submodular functions Mathematical Programming 82 1-2 1998 3 12
-
(1998)
Mathematical Programming
, vol.82
, Issue.12
, pp. 3-12
-
-
Queyranne, M.1
-
27
-
-
85162051091
-
Efficient minimization of decomposable submodular functions
-
Peter Stobbe, Andreas Krause, Efficient minimization of decomposable submodular functions, in: Proc. Neural Information Processing Systems, NIPS, 2010, pp. 2208-2216.
-
(2010)
Proc. Neural Information Processing Systems, NIPS
, pp. 2208-2216
-
-
Stobbe, P.1
Krause, A.2
-
28
-
-
77953225043
-
Joint optimization of segmentation and appearance models
-
Sara Vicente, Vladimir Kolmogorov, Carsten Rother, Joint optimization of segmentation and appearance models, ICCV, 2009, pp. 755-762.
-
(2009)
ICCV
, pp. 755-762
-
-
Vicente, S.1
Kolmogorov, V.2
Rother, C.3
-
29
-
-
69249212370
-
The expressive power of binary submodular functions
-
Stanislav Živn, David A. Cohen, and Peter G. Jeavons The expressive power of binary submodular functions Discrete Applied Mathematics 157 15 2009 3347 3358
-
(2009)
Discrete Applied Mathematics
, vol.157
, Issue.15
, pp. 3347-3358
-
-
Živn, S.1
Cohen, D.A.2
Jeavons, P.G.3
-
30
-
-
77954759797
-
Classes of submodular constraints expressible by graph cuts
-
Stanislav Živn, and Peter G. Jeavons Classes of submodular constraints expressible by graph cuts Constraints 15 3 2010 430 445
-
(2010)
Constraints
, vol.15
, Issue.3
, pp. 430-445
-
-
Živn, S.1
Jeavons, P.G.2
|