Presents the first Õ(log^{1.5} n)-approximation algorithm for the graph label selection problem under a standard budget constraint.
Proceedings of the AAAI Conference on Artificial Intelligence , author=
2 Pith papers cite this work, alongside 6 external citations. Polarity classification is still indexing.
2
Pith papers citing it
6
external citations · OpenAlex
years
2026 2verdicts
UNVERDICTED 2representative citing papers
CRAFT is a Pareto-front prompt optimizer that allocates scarce LLM validation calls to candidates near the current front using accuracy- and cost-oriented generators plus NSGA-II retention.
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.
-
CRAFT: Cost-aware Refinement And Front-aware Tuning of Prompts
CRAFT is a Pareto-front prompt optimizer that allocates scarce LLM validation calls to candidates near the current front using accuracy- and cost-oriented generators plus NSGA-II retention.