Content deleted Content added
→Submodular set function maximization: we do not need a page number within a journal article whose entire topic is this claim, and whose abstract states this claim, and our citation templates do not provide a mechanism for augmenting journal articles with page numbers that are not the whole range of page numbers for the whole article |
|||
Line 113:
<ref name="IFF">{{cite journal |first1=S. |last1=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 |author-link=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 |doi-access=free }}</ref>
<ref name="IJB">R. Iyer, [[Stefanie Jegelka|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>
<ref name="IBUAI">R. Iyer and J. Bilmes, Algorithms for Approximate Minimization of the Difference between Submodular Functions, In Proc. UAI (2012).</ref>
| |||