Free Delivery Over $100
|
|
|||
|
||||
OverviewDominating set is one of the graph theoretical structures and has many important applications such as clustering, intrusion detection and backbone formation in wireless sensor networks; placement of gateways in wireless mesh networks; summarizing multiple documents and selecting queries for information retrieval on the internet. Finding the minimum weighted connected dominating set is an NP-Hard problem. Hence, approximation algorithms and meta-heuristic algorithms can give effective results in polynomial time. In this book, different meta-heuristic algorithms are studied for the minimum weighted connected dominating set problem. Full Product DetailsAuthor: Zuleyha Akusta Dagdeviren , M Serdar KorukogluPublisher: LAP Lambert Academic Publishing Imprint: LAP Lambert Academic Publishing Dimensions: Width: 15.20cm , Height: 0.70cm , Length: 22.90cm Weight: 0.177kg ISBN: 9786203304718ISBN 10: 6203304719 Pages: 112 Publication Date: 15 March 2021 Audience: General/trade , General Format: Paperback Publisher's Status: Active Availability: In stock  We have confirmation that this item is in stock with the supplier. It will be ordered in for you and dispatched immediately. Table of ContentsReviewsAuthor InformationTab Content 6Author Website:Countries AvailableAll regions |
||||
