Submodular set function: Difference between revisions

Revision as of 06:43, 12 May 2020

Revision as of 11:31, 1 September 2020

Line 80:

{{reflist|30em|

refs=

<ref name="GLS">{{cite journal |authorlink=Martin Grötschel |firstfirst1=M. |lastlast1=Grötschel |authorlink2=László Lovász |first2=L. |last2=Lovasz |authorlink3=Alexander Schrijver |first3=A. |last3=Schrijver |title=The ellipsoid method and its consequences in combinatorial optimization |journal=Combinatorica |volume=1 |issue=2 |year=1981 |pages=169–197 |doi=10.1007/BF02579273 |hdl=10068/182482 |s2cid=43787103 |hdl-access=free }}</ref>

<ref name="Cunningham">{{cite journal |first=W. H. |last=Cunningham |title=On submodular function minimization |journal=Combinatorica |volume=5 |issue=3 |year=1985 |pages=185–192 |doi=10.1007/BF02579361 |s2cid=33192360 }}</ref>

<ref name="IFF">{{cite journal |firstfirst1=S. |lastlast1=Iwata |first2=L. |last2=Fleischer |first3=S. |last3=Fujishige |title=A combinatorial strongly polynomial algorithm for minimizing submodular functions |journal=J. ACM |volume=48 |year=2001 |issue=4 |pages=761–777 |doi=10.1145/502090.502096 |s2cid=888513 }}</ref>

<ref name="Schrijver">{{cite journal |authorlink=Alexander Schrijver |first=A. |last=Schrijver |title=A combinatorial algorithm minimizing submodular functions in strongly polynomial time |journal=J. Combin. Theory Ser. B |volume=80 |year=2000 |issue=2 |pages=346–355 |doi=10.1006/jctb.2000.1989 |url=https://ir.cwi.nl/pub/2108 }}</ref>

<ref name="IJB">R. Iyer, S. Jegelka and J. Bilmes, Fast Semidifferential based submodular function optimization, Proc. ICML (2013).</ref>

<ref name="IB">R. Iyer and J. Bilmes, Submodular Optimization Subject to Submodular Cover and Submodular Knapsack Constraints, In Advances of NIPS (2013).</ref>