Poetry Madness
 
 

Recently Viewed clear list


Q&A | February 27, 2014

Rene Denfeld: IMG Powell’s Q&A: Rene Denfeld



Describe your latest book. The Enchanted is a story narrated by a man on death row. The novel was inspired by my work as a death penalty... Continue »
  1. $18.19 Sale Hardcover add to wish list

    The Enchanted

    Rene Denfeld 9780062285508

spacer

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 S.
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
Copyright:
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. Combinatorics for Computer Science... Used Trade Paper $13.50
  3. Nonlinear Ordinary Differential... Used Hardcover $85.00
  4. Non-Linear Elastic Deformations New Trade Paper $27.95
  5. Asymptotic Methods in Analysis New Trade Paper $14.95
  6. Theory and Application of Infinite... New Trade Paper $22.95

Related Subjects

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

Combinatorial Optimization: Networks and Matroids Used Trade Paper
0 stars - 0 reviews
$12.50 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.