One platform for all researcher needs
AI-powered academic writing assistant
Your #1 AI companion for literature search
AI tool for graphics, illustrations, and artwork
Unlock unlimited use of all AI tools with the Editage Plus membership.
Explore Editage Plus
Audio Papers
Ask R Discovery
Translation
Auto-sync
Collaboration
Open Accesshttps://doi.org/10.1016/j.disopt.2019.04.001
Copy DOI
Export
Save
Share
Cite Journal: Discrete Optimization |  Publication Date: May 3, 2019 |
 Citations: 3 |  License type: publisher-specific-oa |
Affiliation: Kyoto University
Recently Dadush et al. (2017) have devised a polynomial submodular function minimization (SFM) algorithm based on their LP algorithm. In the present note we also show a weakly polynomial algorithm for SFM based on the recently developed linear programming feasibility algorithm of Chubanov (2017) to stimulate further research on SFM.
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
