Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
2002.02487
Cited By
Efficient Algorithms for Generating Provably Near-Optimal Cluster Descriptors for Explainability
6 February 2020
Prathyush Sambaturu
Aparna Gupta
Ian Davidson
S. S. Ravi
A. Vullikanti
A. Warren
Re-assign community
ArXiv
PDF
HTML
Papers citing
"Efficient Algorithms for Generating Provably Near-Optimal Cluster Descriptors for Explainability"
1 / 1 papers shown
Title
Multi-Objective Maximization of Monotone Submodular Functions with Cardinality Constraint
R. Udwani
53
32
0
17 Nov 2017
1
