Submodular set function: Difference between revisions

Revision as of 06:50, 26 March 2012

Revision as of 06:53, 31 March 2012

Line 81:

{{reflist|

refs=

<ref name="GLS">M. Grotschel, L. Lovasz, and [[Alexander Schrijver|A. Schrijver ]], The ellipsoid method and its consequences in combinatorial optimization,Combinatorica,1 (1981),pp. 169–197.</ref>

<ref name="Cunningham">W. H. Cunningham, On submodular function minimization, Combinatorica,5 (1985),pp. 185–192.</ref>

<ref name="IFF"> S. Iwata, L. Fleischer, and S. Fujishige, A combinatorial strongly polynomial algorithm for minimizing submodular functions,J. ACM,48 (2001),pp. 761–777</ref>

<ref name="Schrijver">[[Alexander Schrijver|A. Schrijver]], A combinatorial algorithm minimizing submodular functions in strongly polynomial time,J. Combin. Theory Ser. B,80 (2000),pp. 346–355.</ref>

<ref name="FMV">U. Feige, V. Mirrokni and J. Vondr´ak. Maximizing non-monotone submodular functions, Proc. of 48th FOCS (2007), 461–471.</ref>

<ref name="NVF"> [[George Nemhauser|G. L. Nemhauser]], L. A. Wolsey and M. L. Fisher. An analysis of approximations for maximizing submodular set functions I, Mathematical Programming 14 (1978), 265–294</ref>

Line 91:

==References==

===General References===

*{{Citation|last=Schrijver|first=Alexander|authorlink=Alexander Schrijver|year=2003|title=Combinatorial Optimization|___location=|publisher=[[Springer]]|isbn=3-540-44389-4}}

*{{Citation|last=Lee|first=Jon|authorlink=Jon Lee (mathematician)|year= 2004 |title=A First Course in Combinatorial Optimization |___location=|publisher=[[Cambridge University Press]]|isbn= 0-521-01012-8}}

*{{Citation|last=Fujishige|first=Saruto|year=2005|title=Submodular Functions and Optimization|___location=|publisher=[[Elsevier]]|isbn=0-444-52086-4}}