Login / Signup

Analysis of polynomial approximation algorithms for constraint expressions.

Karl J. LieberherrStephen A. Vavasis
Published in: Theoretical Computer Science (1983)
Keyphrases
  • approximation algorithms
  • special case
  • np hard
  • minimum cost
  • set cover
  • genetic algorithm
  • learning algorithm
  • objective function
  • worst case
  • network design problem