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

I mainly carry imported books from South East Asia / South Asia for readers of all Age Groups.

Visit Seller's Storefront

Seller's business information

PLETOS INC
6931 51st Avenue, WOODSIDE, Woodside, NY, 11377, U.S.A.

Sale & Shipping Terms

Terms of Sale

We accept return for those books which are received damaged. Though we take appropriate care in packing to avoid such situation.

Shipping Terms

Shipping rates within U.S.A.

Shipping rates within U.S.A.
Order quantity	12 to 19 business days	12 to 14 business days
First item	US$ 3.99	US$ 6.99

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.