2012 Puddly Awards
 
 
Follow us on TwitterFollow us on FacebookFollow us on TumblrSubscribe to RSS

Recently Viewed clear list

spacer
Free Shipping!

This item may be
out of stock.
Click on the button below to search for this title in other formats.
Check for Availability
Add to Wishlist

Combinatorial Optimization: Networks and Matroids

Combinatorial Optimization: Networks and Matroids Cover

 

Synopses & Reviews

Publisher Comments:

Perceptively written text examines optimization problems that can be formulated in terms of networks and algebraic structures called matroids. Chapters cover shortest paths, network flows, bipartite matching, nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the matroid parity problems. A suitable text or reference for courses in combinatorial computing.

Book News Annotation:

Reprints a work originally published by Holt, Rinehart and Winston (New York, 1976). Focusing on combinatorial optimization problems involving matroids, this text is suitable for courses in combinatorial computing and concrete computational complexity in departments of computer science and mathematics. After introducing the basic mathematical principles involved, the book examines shortest paths, network flows, and bipartite matching. It then goes on to discuss non-bipartite matching, the greedy algorithm, matroid intersections, and the matroid parity problem.
Annotation c. Book News, Inc., Portland, OR (booknews.com)

Synopsis:

Perceptive text examines shortest paths, network flows, bipartite and nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the matroid parity problems. Suitable for courses in combinatorial computing and concrete computational complexity.
back to top
back to top

Product Details

ISBN:
9780486414539
Subtitle:
Networks and Matroids
Author:
Lawler, Eugene S.
Author:
Mathematics
Author:
Lawler, Eugene
Publisher:
Dover Publications
Location:
Mineola, N.Y.
Subject:
Algorithms
Subject:
Game Theory
Subject:
Combinatorics
Subject:
Computational complexity
Subject:
Combinatorial optimization
Subject:
Matroids
Subject:
Network analysis
Subject:
General Mathematics
Subject:
Optimization Problems
Subject:
Algebraic structures
Edition Description:
Trade Paper
Series:
Dover Books on Mathematics
Series Volume:
108-409
Publication Date:
20111110
Binding:
Paperback
Language:
English
Illustrations:
Yes
Pages:
400
Dimensions:
8.5 x 5.38 in 0.91 lb
back to top
Combinatorial Optimization: Networks and Matroids
0 stars - 0 reviews
$ In Stock
Product details 400 pages Dover Publications - English 9780486414539 Reviews:
"Synopsis" by , Perceptive text examines shortest paths, network flows, bipartite and nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the matroid parity problems. Suitable for courses in combinatorial computing and concrete computational complexity.
spacer
spacer
  • back to top
Follow us on...


Powell's City of Books is an independent bookstore in Portland, Oregon, that fills a whole city block with more than a million new, used, and out of print books. Shop those shelves — plus literally millions more books, DVDs, and eBooks — here at Powells.com.