This book "Divide and Conquer Algorithms for Multi-dimensional Problems" not only present algorithms and analysis of advanced real-life problems but also prepares you to have a deep understanding of how these algorithms were originally designed and an ability to solve some of the most insightful algorithmic problems.

This is a must read if you want to dive deeper into understanding Algorithms and its advanced applications.

Multidimensional divide and conquer is an algorithmic technique that can be used to develop several algorithms and data structures for multi-dimensional problems. It is an extension of Divide and Conquer algorithms.

The basic idea of Divide and Conquer is to divide the problem into smaller problems, solve the smaller problems and use the answers from the smaller problems to get the answer to the larger problem.

Merge Sort is a popular algorithm that applies Divide and Conquer to sort 1-dimensional data.

Extending such algorithms for Multi-dimensional data is not simple but it is an interesting approach that which nurture your thinking process and is more widely used as it reflects real-life problems.

This is important as most real-life problems are multi-dimensional like:
o A map of Earth is a 2-dimensional data
o Text is a multi-dimensional data for Clustering problems
o Augmented reality is usually 3-dimensional data
o Game graphics are at-least 3-dimensional data
o Physics consider our Universe to be 11-dimensional data

We use this paradigm to give best-known solutions to problems such as:
o Empirical Cumulative Distribution Functions problem (ECDF)
o Maxima problemo Range searching problem
o Closest pair problem
o All nearest neighbor problems

For all problems, we have demonstrated 1-dimension problem, 2-dimension problem, 3-dimension problem, k-dimension problem (all with time complexity analysis) and real-life applications.

We, also, presented open question in this domain which you can think about and potentially, develop a solution.

Read this book now and change the way you think about algorithms. This is a must read for everyone who wants to truely understand Algorithms and apply it to solve advanced problems.

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

Store Description

Hello! Ria Christie Collections is an online venture that was initially set up in 2012 to sell books. We do not have a physical high street store. We are professional online booksellers. We only sell brand new books in perfect condition that we source from various suppliers and the publishers. Primarily, our aim is to provide an excellent service to all our customers. We always work as a team to achieve this. Our other objectives are to: 1. Ensure that all our products reach their destination quickly in a safe and secure manner 2. Answer to all our customer queries within 24 hours 3. Ensure that our customers are happy with their purchases 4. Provide all the items at a competitive price 5. Always listen to our customers Ria Christie Collections is not a registered company. It is a Sole Trader venture. Other key information is shown below: Contact Person Name: Rakesh Luchmun (Mr) Storefront Name: Ria Christie Collections Place of Establishment Address: Suite B; ARUN House; ARUN Building Arundel Road Uxbridge UB8 2RR United Kingdom E-Mail Address: riachristie@hotmail.co.uk VAT Number: GB 160 5650 25 We always work hard and aim to comply with all of Abebooks Policies. If you have any issues, please do not hesitate to write to us whether before or after a purchase. We promise to reply to you promptly and, in any case, within 24 hours. Thank you kindly! Yours sincerely Mr Rakesh Luchmun (Founder) and the Ria Christie Collections Team

Visit Seller's Storefront

Seller's business information

Ryefield Investments Limited
175 Pield Heath Road, Uxbridge, UB8 3NL, United Kingdom

Terms of Sale:

All Returns and Refund are as per Abebooks policies.

Shipping Terms:

Orders usually ship within 2 business days. If your book order is heavy or oversized, we may contact you to let you know extra shipping is required. Thank you!

Payment Methods
accepted by seller

Add to Wants

Items related to Divide and Conquer Algorithms for Multi-dimensional...

Divide and Conquer Algorithms for Multi-dimensional Problems (Advanced Data Structures & Algorithms)

Chatterjee, Aditya; QoChuk, Benjamin; Drishya, K. Sai

New - Soft cover

Seller's business information