On bisubmodular maximization

Journal of Machine Learning Research

Volumn 22, Issue , 2012, Pages 1055-1063

  Singh, Ajit P ^a   Guillory, Andrew ^a   Bilmes, Jeff ^a  

^a UNIVERSITY OF WASHINGTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE;

BISUBMODULARITY; CONSTANT-FACTOR APPROXIMATION ALGORITHMS; SENSOR PLACEMENT; SET FUNCTION; SUBMODULARITY; VALUE OF INFORMATION;

APPROXIMATION ALGORITHMS;

EID: 84954222784     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (25)

1. K. Ando, S. Fujishige, and T. Naitoh. A characterization of bisubmodular functions. Discrete Mathematics, 148(1-3):299-303, 1996.
2. G. Calinescu, C. Chekuri, M. Pál, and J. Vondrák. Maximizing a monotone submodular function subject to a matroid constraint. SIAM Journal on Computing, 40(6), 2011.
3. K. Chakrabarty, S. Iyengar, H. Qi, and E. Cho. Grid coverage for surveillance and target location in distributed sensor networks. Computers, IEEE Transactions on, 51(12):1448-1453, 2002.
4. C. Chekuri, J. Vondrák, and R. Zenklusen. Dependent randomized rounding via exchange properties of combinatorial structures. In FOCS, 2010.
5. U. Feige, V. S. Mirrokni, and J. Vondrak. Maximizing non-monotone submodular functions. In FOCS, 2007.
6. M. L. Fisher, G. L. Nemhauser, and L. A. Wolsey. An analysis of approximations for maximizing submodular set functions II. Polyhedral combinatorics, pages 73-87, 1978.
7. S. Fujishige and S. Iwata. Bisubmodular function minimization. In Integer Programming and Combinatorial Optimization, 2001.
8. G. Fusco and H. Gupta. Selection and orientation of directional sensors for coverage maximization. In 6th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks, 2009.
9. D. Golovin, A. Krause, and M. Streeter. Online learning of assignments that maximize submodular functions. In NIPS, 2009.
10. P. R. Goundan and A. S. Schulz. Revisiting the greedy approach to submodular set function maximization. Working paper, MIT, 2007.
11. E. Hörster and R. Lienhart. On the optimal placement of multiple visual sensors. In 4th ACM International Workshop on Video Surveillance and Sensor Networks, 2006.
12. D. Kempe, J. Kleinberg, and E. Tardos. Maximizing the spread of influence through a social network. In KDD, 2003.
13. C. Ko, J. Lee, and M. Queyranne. An exact algorithm for maximum entropy sampling. Ops Research, 43(4):684-691, 1995.
14. A. Krause and C. Guestrin. Optimal nonmyopic value of information in graphical models-efficient algorithms and theoretical limits. In Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI), pages 1339-1345, 2005.
15. A. Krause, H. McMahan, C. Guestrin, and A. Gupta. Robust submodular observation selection. JMLR, 2008.
16. A. Krause, A. Singh, and C. Guestrin. Nearoptimal sensor placements in Gaussian processes: Theory, efficient algorithms and empirical studies. JMLR, 9:235-284, 2008.
17. A. Krause, R. Rajagopal, A. Gupta, and C. Guestrin. Simultaneous placement and scheduling of sensors. In Information Processing in Sensor Networks, 2009.
18. J. Lee, V. S. Mirrokni, V. Nagarajan, and M. Sviridenko. Maximizing nonmonotone submodular functions under matroid or knapsack constraints. SIAM Journal on Discrete Mathematics, 23(4), 2010.
19. J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, J. VanBriesen, and N. Glance. Cost-effective outbreak detection in networks. In KDD, 2007.
20. H. Lin and J. Bilmes. Multi-document summarization via budgeted maximization of submodular functions. In NAACL/HLT, 2010.
21. B. Mutlu, A. Krause, J. Forlizzi, C. Guestrin, and J. Hodgins. Robust, low-cost, non-intrusive sensing and recognition of seated postures. In UIST, 2007.
22. G. L. Nemhauser, L. A. Wolsey, and M. L. Fisher. An analysis of approximations for maximizing submodular set functions I. Mathematical Programming, 14:265-294, 1978.
23. L. Qi. Directed submodularity, ditroids and directed submodular flows. Mathematical Programming, 42:579-599, 1988.
24. L. Qi. Bisubmodular functions. CORE Discussion Papers 1989001, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE), 1989.
25. C. Seshadri and J. Vondrák. Is submodularity testable? In Innovations in Computer Science (ICS), 2011.