Description: This package includes the JAVA code of the POMC algorithm  for maximizing monotone set functions with monotone cost constraints. It uses a randomized iterative procedure to solve the bi-objective reformulation of the original problem: maximizing the objective function and minimizing the cost function. A Readme file and an example file are included in the package. In the 'Example.java', you will find an example of using this code for influence maximization with routing constraints.
Reference:  Chao Qian, Jing-Cheng Shi, Yang Yu and Ke Tang. On subset selection with general cost constraints. In: Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI'17), Melbourne, Australia, 2017.
ATTN: This package is free for academic usage. You can run it at your own risk. For other purposes, please contact Dr. Chao Qian (chaoqian@ustc.edu.cn).
Requirement: The package was developed with JAVA.
ATTN2: This package was developed by Mr. Jing-Cheng Shi (shijc@lamda.nju.edu.cn) and Dr. Chao Qian (chaoqian@ustc.edu.cn). For any problem concerning the code, please feel free to contact Mr. Shi or Dr. Qian.