Network flow algorithms / David P Williamson

By:

Williamson, David P

Material type: Text

TextLanguage: English Publication details: Cambridge : Cambridge University Press, 2019.Edition: 1st edDescription: 314 pISBN:

9781316636831

Subject(s):

DDC classification:

003 WIL

Summary: The book "Network Flow Algorithms" by David P. Williamson provides a comprehensive overview of efficient combinatorial algorithms for various network flow problems. It covers topics such as maximum flows, minimum-cost flows, generalized flows, multicommodity flows, and global minimum cuts. The book also discusses recent research on computing electrical flows and their applications to classical network flow problems. It is a valuable resource for graduate students and researchers in theoretical computer science, operations research, and discrete math who are interested in modeling and solving problems related to the transportation of goods, information, and other applications.

Tags from this library: No tags from this library for this title. Log in to add tags.

Average rating: 0.0 (0 votes)

Holdings ( 1 )
Title notes ( 2 )

Holdings
Item type	Current library	Collection	Shelving location	Call number	Status	Barcode
Reference	Kalaignar Centenary Library Madurai	ENGLISH-REFERENCE BOOKS	நான்காம் தளம் / Fourth floor	003 WIL (Browse shelf(Opens below))	Not for loan	285953

Browsing Kalaignar Centenary Library Madurai shelves, Shelving location: நான்காம் தளம் / Fourth floor, Collection: ENGLISH-REFERENCE BOOKS Close shelf browser (Hides shelf browser)

Previous								Next
Previous	003 BEA Realization and model reduction of dynamical systems, a festschrift In honor of the 70Th birthday of Thanos Antoulas /	003 JEN Self-organized criticality : emergent complex behavior in physical and biological system /	003 LIN Complexity and the arrow of time /	003 WIL Network flow algorithms /	003.1 KAT Subspace methods for system identification /	003.3 JIN Geometric Methods and Applications: For Computer Science and Engineering /	003.3 PET Development Strategies for Tourism Industry /	Next

Includes bibliographical references (p. 294-306) and index.

The book "Network Flow Algorithms" by David P. Williamson provides a comprehensive overview of efficient combinatorial algorithms for various network flow problems. It covers topics such as maximum flows, minimum-cost flows, generalized flows, multicommodity flows, and global minimum cuts. The book also discusses recent research on computing electrical flows and their applications to classical network flow problems. It is a valuable resource for graduate students and researchers in theoretical computer science, operations research, and discrete math who are interested in modeling and solving problems related to the transportation of goods, information, and other applications.

Network flow algorithms / David P Williamson

Browsing Kalaignar Centenary Library Madurai shelves, Shelving location: நான்காம் தளம் / Fourth floor, Collection: ENGLISH-REFERENCE BOOKS Close shelf browser (Hides shelf browser)

Find us on the map