Magnificent Marvel Supersale
 
 

Special Offers see all

Enter to WIN a $100 Credit

Subscribe to PowellsBooks.news
for a chance to win.
Privacy Policy

Visit our stores


    Recently Viewed clear list


    The Powell's Playlist | February 27, 2015

    Kazuo Ishiguro: IMG Kazuo Ishiguro's Playlist for The Buried Giant



    The eight songs on this playlist didn't "inspire" The Buried Giant, nor did I play them out loud while writing. And with the notable exception of... Continue »

    spacer
Qualifying orders ship free.
$24.95
New Trade Paper
Ships in 1 to 3 days
Add to Wishlist
available for shipping or prepaid pickup only
Available for In-store Pickup
in 7 to 12 days
Qty Store Section
25 Remote Warehouse Mathematics- Combinatorics

Combinatorial Optimization: Networks and Matroids

by

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 and concrete computational complexity in departments of computer science and mathematics.

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.

Table of Contents

Preface 
Chapter 1 INTRODUCTION
Chapter 2 MATHEMATICAL PRELIMINARIES

Chapter 3 SHORTEST PATHS

Chapter 4 NETWORK FLOWS

Chapter 5 BIPARTITE MATCHING  

Chapter 6 NONBIPARTITE MATCHING  

Chapter 7 MATROIDS AND THE GREEDY ALGORITHM  
Chapter 8 MATROID INTERSECTIONS
Chapter 9 THE MATROID PARITY PROBLEM

Author Index 

 Subject Index

Product Details

ISBN:
9780486414539
Author:
Lawler, Eugene S.
Publisher:
Dover Publications
Author:
Lawler, Eugene
Author:
Mathematics
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
Subject:
Mathematics-Combinatorics
Edition Description:
Trade Paper
Series:
Dover Books on Mathematics
Series Volume:
108-409
Publication Date:
20111131
Binding:
TRADE PAPER
Language:
English
Illustrations:
Yes
Pages:
384
Dimensions:
8.5 x 5.38 in 0.91 lb

Other books you might like

  1. First-Order Partial Differential... New Trade Paper $24.95
  2. Nonlinear Ordinary Differential... Used Hardcover $60.00
  3. Non-Linear Elastic Deformations Used Trade Paper $14.00
  4. Asymptotic Methods in Analysis New Trade Paper $14.95
  5. Theory & Application of Infinite Series Used Trade Paper $12.00
  6. Random Graphs (Wiley Interscience... New Hardcover $188.25

Related Subjects

» Science and Mathematics » Mathematics » Combinatorics
» Science and Mathematics » Mathematics » Modeling

Combinatorial Optimization: Networks and Matroids New Trade Paper
0 stars - 0 reviews
$24.95 In Stock
Product details 384 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 gifts — here at Powells.com.