Author:
Ausiello Giorgio,Boria Nicolas,Giannakos Aristotelis,Lucarelli Giorgio,Paschos Vangelis Th.
Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. Saha, B., Getoor, L.: On maximum coverage in the streaming model & application to multi-topic blog-watch. In: DM 2009, pp. 697–708. SIAM, Philadelphia (2009)
2. Feige, U.: A threshold of ln n for approximating set cover. Journal of the ACM 45, 634–652 (1998)
3. Hochbaum, D.S., Pathria, A.: Analysis of the greedy approach in problems of maximum k-coverage. Naval Research Logistics 45, 615–627 (1998)
4. Lecture Notes in Computer Science;A.A. Ageev,1999
5. Feige, U., Langberg, M.: Approximation algorithms for maximization problems arising in graph partitioning. Journal of Algorithms 41, 174–211 (2001)
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. TED$^+$: Towards Discovering Top-k Edge-Diversified Patterns in a Graph Database;IEEE Transactions on Knowledge and Data Engineering;2023
2. One Set to Cover All Maximal Cliques Approximately;Proceedings of the 2022 International Conference on Management of Data;2022-06-10
3. Mining Maximal Clique Summary with Effective Sampling;2019 IEEE International Conference on Data Mining (ICDM);2019-11
4. Fast diversified coherent core search on multi-layer graphs;The VLDB Journal;2019-07-01
5. Diversified Coherent Core Search on Multi-Layer Graphs;2018 IEEE 34th International Conference on Data Engineering (ICDE);2018-04