Abstract
The spider covering framework was originally proposed by Klein and Ravi (1993) in their attempt to design a tight approximation algorithm for the node-weighted network design problem. In this framework, an algorithm constructs a solution by repeatedly choosing a low-density graph. The analysis based on this framework basically follows from the idea used in the analysis of the well-known greedy algorithm for the set cover problem. After Klein and Ravi, the framework has been sophisticated in a series of studies, and efficient approximation algorithms for numerous network design problems have been proposed. In this article, we survey these studies on the spider covering framework.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
