Paradigms for Fast Parallel Approximability

By: No Information Available

Write A Review

Paperback | 30 July 2009

At a Glance

Paperback
168 Pages

Dimensions(cm)
24.41 x 16.99 x 0.91

Paperback

RRP $75.95

$71.75

or 4 interest-free payments of $17.94 with

Ships in 5 to 7 business days

Various problems in computer science are 'hard', that is NP-complete, and so not realistically computable; thus in order to solve them they have to be approximated. This book is a survey of the basic techniques for approximating combinatorial problems using parallel algorithms. Its core is a collection of techniques that can be used to provide parallel approximations for a wide range of problems (for example, flows, coverings, matchings, travelling salesman problems, graphs), but in order to make the book reasonably self-contained, the authors provide an introductory chapter containing the basic definitions and results. A final chapter deals with problems that cannot be approximated, and the book is ended by an appendix that gives a convenient summary of the problems described in the book. This is an up-to-date reference for research workers in the area of algorithms, but it can also be used for graduate courses in the subject.

Industry Reviews

Review of the hardback: 'Required reading for researchers working on parallel algorithms and of interest to anyone working in the area of parallel computing in general.' Brian Bramer, CVu

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

Orders over $79.00 qualify for free shipping.

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.

Defective items

If there is a problem with any of the items received for your order then the Booktopia Customer Care team is ready to assist you.

For more info please visit our Help Centre.

You Can Find This Book In

Non-Fiction Computing & I.T.Computer Science Computer Architecture & Logic Design Parallel Processing Computer Hardware Grid & Parallel Computing Computer Programming & Software Development Algorithms & Data Structures Computer Networking & Communications Mathematics

Introduction
Basic concepts
Extremal graph properties
Rounding, interval partitioning and separation
Primal-dual method
Graph decomposition
Further parallel approximations
Non-approximability
Syntactical defined phrases
Appendix: Definition of problems
Bibliography
Index
Table of Contents provided by Publisher. All Rights Reserved.

Paradigms for Fast Parallel Approximability

At a Glance

Paperback

Industry Reviews

Shipping

How to return your order

Defective items

You Can Find This Book In

More in Parallel Processing

Parallel Computing

Design and Analysis of Algorithms

Site Reliability Engineering

How Google Runs Production Systems

Building Microservices

Designing Fine-Grained Systems 2nd Edition

Fundamentals of Software Architecture

A Modern Engineering Approach

Software Architecture: The Hard Parts

Modern Trade-Off Analyses for Distributed Architectures

Technology Strategy Patterns

Analyzing and Communicating Architectural Decisions

Rust Atomics and Locks

Low-Level Concurrency in Practice

Kubernetes - Up and Running

Dive into the Future of Infrastructure

Quantum Artificial Intelligence

Technologies, Algorithms and Programming

Introduction to Machine Learning Algorithms

Basic Principles and Mathematics

Introduction to High Performance Computing for Scientists and Engineers

Chapman & Hall/CRC Computational Science

Deep Learning in Genome Mapping

Computation and Analysis

Learning Apache OpenWhisk

Developing Open Serverless Solutions

Monolith to Microservices

Evolutionary Patterns to Transform Your Monolith

Kafka for Architects

Event-driven Architecture, Logs, Microservices, Real-time Event Processing

Seeking SRE

Conversations about running production systems at scale

Foundations of Scalable Systems

Designing Distributed Architectures

Production Kubernetes

Building Successful Application Platforms

Flow Architectures

The Future of Streaming and Event-Driven Integration

Streaming Data Pipelines with Apache Kafka

Server-Side WebAssembly

Lightweight Apps With Wasm

Modern Concurrency in Java

A Deep Dive Into Virtual Threads, Structured Concurrency, and Scoped Values

Fundamentals of Metadata Management

Uncover the Meta Grid and Unlock Data, Information, and Knowledge Management

Practical Microservices

Build Event-Driven Architectures with Event Sourcing and CQRS

This product is categorised by