Shortest Path Problem / Najlacnejšie knihy
Shortest Path Problem

Code: 06390180

Shortest Path Problem

by American Mathem American Mathem

Shortest path problems are among the most fundamental combinatorial optimization problems with many applications, both direct and as subroutines. This title reports on the research carried out by participants during the Ninth DIMA ... more

146.57

Availability:

50/50We think title might be available. Upon your order we will do our best to get it within 6 weeks.
We search the world

Availability alert

Add to wishlist

You might also like

Give this book as a present today
  1. Order book and choose Gift Order.
  2. We will send you book gift voucher at once. You can give it out to anyone.
  3. Book will be send to donee, nothing more to care about.

Book gift voucher sampleRead more

Availability alert

Availability alert


Your agreement - Submiting you agree to the Terms and Condtions.

We will watch availability for you

Enter your e-mail address and once book will be available,
we will send you a message. It's that simple.

More about Shortest Path Problem

You get 355 loyalty points

Book synopsis

Shortest path problems are among the most fundamental combinatorial optimization problems with many applications, both direct and as subroutines. This title reports on the research carried out by participants during the Ninth DIMACS Implementation Challenge, which led to several improvements of the state of the art in shortest path algorithms.

Book details

Book category Books in English Mathematics & science Mathematics Discrete mathematics

146.57



Collection points Bratislava a 12830 dalších

Copyright ©2008-26 najlacnejsie-knihy.sk All rights reservedPrivacyCookies


Account: Log in
Všetky knihy sveta na jednom mieste. Navyše za skvelé ceny.

Shopping cart ( Empty )

For free shipping
shop for 59,99 € and more

You are here: