Presents the first Õ(log^{1.5} n)-approximation algorithm for the graph label selection problem under a standard budget constraint.
Proceedings of the 35th International Conference on Neural Information Processing Systems , articleno =
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
An Approximation Algorithm for Graph Label Selection
Presents the first Õ(log^{1.5} n)-approximation algorithm for the graph label selection problem under a standard budget constraint.