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.
Dynamic programming treatment of the travelling salesman problem.Journal of the ACM (JACM), 9(1):61–63, 1962
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.CG 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 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.