Abstract
We consider a new dynamic edge covering and scheduling problem that focuses on assigning resources to nodes in a network to minimize the amount of time required to process all edges in it. Resources need to be co-located at the endpoints of an edge for it to be processed and, therefore, this problem contains both edge covering and scheduling decisions. These new problems have motivating applications in traffic systems and military intelligence operations. We provide complexity results for the dynamic edge covering and scheduling problem over different types of networks. We then show that existing approximation algorithms for parallel machine scheduling problems can be leveraged to provide approximation algorithms for this new class of problems over certain types of networks.
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.
