Optimizing Urban Resource Allocation Using Minimum Dominating Sets in Interval Graphs

Author(s)	Mr. Mangal Pati, Dr. Uma Shankar, Dr. Prodip Karmakar, Dr. Sambhu Charan Barman
Country	India
Abstract	Efficient resource allocation in urban environments is a critical challenge for modern city planning, particularly in the context of limited budgets and increasing service demands. This paper presents a graph-theoretic approach to optimizing resource allocation by modeling urban zones as interval graphs and identifying Minimum Dominating Sets (MDS) to ensure complete coverage with minimal redundancy. We apply a linear-time MDS algorithm to a case study involving a six-zone urban corridor and demonstrate that full spatial coverage can be achieved using only three zones, effectively halving the number of necessary deployments compared to uniform or heuristic strategies. The results highlight the method’s efficiency, scalability, and potential for integration into real-world planning tools. Discussion includes computational performance, resilience through moderate redundancy, and practical implications for urban infrastructure design. The proposed approach offers a promising solution for data-driven, cost-effective urban resource optimization.
Keywords	Urban Planning, Interval Graphs, Minimum Dominating Set, Linear-time MDS algorithm, Graph Theory, Optimizing Resource Allocation
Field	Mathematics
Published In	Volume 7, Issue 3, May-June 2025
Published On	2025-05-17
DOI	https://doi.org/10.36948/ijfmr.2025.v07i03.44892
Short DOI	https://doi.org/g9kfvq

About IJFMR Fees & Payment Current Issue Publication Archive	Submit Research Paper Track Submission Status Publication Guidelines Publication Ethics Peer Review & Plagiarism	Join as a Reviewer Editors & Reviewers Reviewer Referral Program Get Reviewer Membership Certi.	Website/Journal Policies Usage Policy Content Policies Privacy Policy

Contact Us		+91-9687-828-838	editor@ijfmr.com

International Journal For Multidisciplinary Research