Title: A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions
Abstract: Article Free Access Share on A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions Authors: Satoru Iwata Grad. School of Eng. Science, Osaka University, Toyonaka, Osaka 560-8531, Japan Grad. School of Eng. Science, Osaka University, Toyonaka, Osaka 560-8531, JapanView Profile , Lisa Fleischer Dept. of Ind. Eng. & Oper. Res., Columbia University, New York, NY Dept. of Ind. Eng. & Oper. Res., Columbia University, New York, NYView Profile , Satoru Fujishige Grad. School of Eng. Science, Osaka University, Toyonaka, Osaka 560-8531, Japan Grad. School of Eng. Science, Osaka University, Toyonaka, Osaka 560-8531, JapanView Profile Authors Info & Claims STOC '00: Proceedings of the thirty-second annual ACM symposium on Theory of computingMay 2000Pages 97–106https://doi.org/10.1145/335305.335317Published:01 May 2000Publication History 27citation461DownloadsMetricsTotal Citations27Total Downloads461Last 12 Months47Last 6 weeks22 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF