Accelerated best-first search with upper-bound computation for submodular function maximizationJan 1, 2018·Shinsaku Sakaue,Masakazu Ishihata· 0 min read PDFTypeConference paperPublicationAAAI Conference on Artificial Intelligence (AAAI)Last updated on Jan 1, 2018 ← Efficient bandit combinatorial optimization algorithm with zero-suppressed binary decision diagrams Apr 9, 2018Submodular function maximization over graphs via zero-suppressed binary decision diagrams Jan 1, 2018 →