A framework yields poly(n,k) or f(k)poly(n) time (1-epsilon)-approximations for diverse-solution variants of several NP-hard problems using resource augmentation and k-best enumeration.
Approximation algorithms for NP-complete problems on planar graphs.Journal of the ACM (JACM), 41(1):153–180, 1994
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
method 1
citation-polarity summary
fields
cs.CG 1years
2025 1verdicts
CONDITIONAL 1roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
A Framework for the Design of Efficient Diversification Algorithms to NP-Hard Problems
A framework yields poly(n,k) or f(k)poly(n) time (1-epsilon)-approximations for diverse-solution variants of several NP-hard problems using resource augmentation and k-best enumeration.