neal young / Young16SetCover

  • Png/Young08SetCover.png A brief summary of greedy set-cover algorithms.

    INDEX TERMS: dominating set, greedy algorithm, hitting set, set cover, minimizing a linear function subject to a submodular constraint.

© Copyrights are reserved by the publishers.
Download for personal and limited academic use only.