Submodular function maximization over graphs via zero-suppressed binary decision diagramsJan 1, 2018·Shinsaku Sakaue,Masaaki Nishino,Norihito Yasuda· 0 min read PDFTypeConference paperPublicationAAAI Conference on Artificial Intelligence (AAAI)Last updated on Jan 1, 2018 ← Accelerated best-first search with upper-bound computation for submodular function maximization Jan 1, 2018Exact semidefinite programming relaxations with truncated moment matrix for binary polynomial optimization problems Mar 30, 2017 →