Abstract
An approximate algorithm is proposed for solving the Rectangle Covering Problem based on the quasi-mechanical concept. The phenomenon due to universal gravitation and screen has been simulated. It is pointed out that valuable approximate algorithms can be obtained for large numbers of NP hard problems by following the quasi-mechanical procedure. Behind the quasi-mechanical procedure are the strategies in the priority method in modern recursive theory.
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.
