Combinatorial Optimization: Networks and Matroids - Brossura

Lawler, Eugene

Brossura

ISBN 10: 0486414531 ISBN 13: 9780486414539

Casa editrice: Dover Pubns, 2003

Riassunto

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.

Su questo libro

Product Description

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.

Contenuti

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

Dettagli dell'edizione

• Editore: Dover Pubns
• Data di pubblicazione: 2003
• Lingua: Inglese
• ISBN 10: 0486414531
• ISBN 13: 9780486414539
• Rilegatura: Copertina flessibile
• Numero di pagine: 374
• Contatto del produttore: non disponibile
• Persona responsabile: Soc. Agr. La Raia Ss; http://www.la-raia.it; ; Strada Monterotondo, 79; Novi Ligure; 15067; Italia