Submodular Optimization with Routing Constraints
暂无分享,去创建一个
[1] Andreas Krause,et al. Near-Optimal Sensor Placements in Gaussian Processes: Theory, Efficient Algorithms and Empirical Studies , 2008, J. Mach. Learn. Res..
[2] Maxim Sviridenko,et al. A note on maximizing a submodular set function subject to a knapsack constraint , 2004, Oper. Res. Lett..
[3] Andreas Krause,et al. Cost-effective outbreak detection in networks , 2007, KDD '07.
[4] M. L. Fisher,et al. An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..
[5] Rishabh K. Iyer,et al. Submodular Optimization and Machine Learning: Theoretical Results, Unifying and Scalable Algorithms, and Applications , 2015 .
[6] Yu Zheng,et al. U-Air: when urban air quality inference meets big data , 2013, KDD.
[7] Andreas Krause,et al. Efficient Planning of Informative Paths for Multiple Robots , 2006, IJCAI.
[8] Daniel J. Rosenkrantz,et al. An analysis of several heuristics for the traveling salesman problem , 2013, Fundamental Problems in Computing.
[9] Albert-László Barabási,et al. Statistical mechanics of complex networks , 2001, ArXiv.
[10] Éva Tardos,et al. Maximizing the Spread of Influence through a Social Network , 2015, Theory Comput..
[11] Carlos Guestrin,et al. A Note on the Budgeted Maximization of Submodular Functions , 2005 .
[12] Dirk Van Oudheusden,et al. The orienteering problem: A survey , 2011, Eur. J. Oper. Res..
[13] Adrian Vetta,et al. False-Name Bidding and Economic Efficiency in Combinatorial Auctions , 2014, AAAI.
[14] Alantha Newman,et al. Traveling salesman path problems , 2008, Math. Program..
[15] R. Vohra,et al. The Orienteering Problem , 1987 .
[16] Chandra Chekuri,et al. A recursive greedy algorithm for walks in directed graphs , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[17] Samir Khuller,et al. The Budgeted Maximum Coverage Problem , 1999, Inf. Process. Lett..
[18] Gérard Cornuéjols,et al. Submodular set functions, matroids and the greedy algorithm: Tight worst-case bounds and some generalizations of the Rado-Edmonds theorem , 1984, Discret. Appl. Math..
[19] Satoru Fujishige,et al. Submodular functions and optimization , 1991 .
[20] Yale T. Herer. Submodularity and the traveling salesman problem , 1999, Eur. J. Oper. Res..
[21] Rishabh K. Iyer,et al. Curvature and Optimal Algorithms for Learning and Minimizing Submodular Functions , 2013, NIPS.
[22] Yevgeniy Vorobeychik,et al. Data-driven agent-based modeling, with application to rooftop solar adoption , 2015, Autonomous Agents and Multi-Agent Systems.
[23] Paul Erdös,et al. On random graphs, I , 1959 .
[24] Rishabh K. Iyer,et al. Submodular Optimization with Submodular Cover and Submodular Knapsack Constraints , 2013, NIPS.
[25] Nicos Christofides. Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem , 1976, Operations Research Forum.
[26] Andreas Krause,et al. Submodular Function Maximization , 2014, Tractability.