Dominating 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.

"About this title" may belong to another edition of this title.

Store Description

We specialise in General Interest Books from South Asian countries.

Visit Seller's Storefront

Seller's business information

BOOKS AND PERIODICALS AGENCY LTD
90 Barnet Gate Lane, Barnet, EN5 2AX, United Kingdom

Sale & Shipping Terms

Terms of Sale

Returns accepted if you are not satisfied with the Service or Book.

Shipping Terms

Best packaging and fast delivery

Shipping rates from United Kingdom to U.S.A.

Shipping rates from United Kingdom to U.S.A.
Order quantity	14 to 45 business days	5 to 10 business days
First item	US$ 8.84	US$ 13.40

Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.