Skip to content
Register Sign in Wishlist
Network Flow Algorithms

Network Flow Algorithms

£29.99

  • Publication planned for: August 2019
  • availability: Not yet published - available from August 2019
  • format: Paperback
  • isbn: 9781316636831

£ 29.99
Paperback

Pre-order Add to wishlist

Other available formats:
Hardback


Looking for an inspection copy?

This title is not currently available on inspection

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • Network flow theory has been used across a number of disciplines, including theoretical computer science, operations research, and discrete math, to model not only problems in the transportation of goods and information, but also a wide range of applications from image segmentation problems in computer vision to deciding when a baseball team has been eliminated from contention. This graduate text and reference presents a succinct, unified view of a wide variety of efficient combinatorial algorithms for network flow problems, including many results not found in other books. It covers maximum flows, minimum-cost flows, generalized flows, multicommodity flows, and global minimum cuts and also presents recent work on computing electrical flows along with recent applications of these flows to classical problems in network flow theory.

    • Presents results in the area from a modern computer science algorithms outlook
    • Contains several key algorithms not previously treated in book form, including new algorithms on electrical flow
    • Includes fifty-five end-of-chapter exercises which provide applications and additional algorithms to analyze
    Read more

    Reviews & endorsements

    'More than half a century since network flow theory was introduced by the 1962 book of L. R. Ford and D. R. Fulkerson, the area is still active and attractive. This book, based on course materials taught at Stanford and Cornell Universities, offers a concise and succinct description of most of the important topics, as well as covering recent developments. Its use in graduate courses related to algorithms and optimization is highly recommended.' Toshihide Ibaraki, Kyoto College of Graduate Studies for Informatics, Japan

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity

    ×

    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?

    ×

    Product details

    • Publication planned for: August 2019
    • format: Paperback
    • isbn: 9781316636831
    • dimensions: 228 x 152 mm
    • contains: 52 b/w illus.
    • availability: Not yet published - available from August 2019
  • Table of Contents

    1. Preliminaries: shortest path algorithms
    2. Maximum flow algorithms
    3. Global minimum cut algorithms
    4. More maximum flow algorithms
    5. Minimum-cost circulation algorithms
    6. Generalized flow algorithms
    7. Multicommodity flow algorithms
    8. Electrical flow algorithms
    9. Open questions.

  • Author

    David P. Williamson, Cornell University, New York
    David P. Williamson is a Professor at Cornell University, New York, in the School of Operations Research and Information Engineering. He has won several awards for his work in discrete optimization, including the 2000 Fulkerson Prize, sponsored by the American Mathematical Society and the Mathematical Programming Society. His previous book, The Design of Approximation Algorithms (Cambridge, 2011), co-authored with David B. Shmoys, won the 2013 INFORMS Lanchester Prize. He has served on several editor boards, and was editor-in-chief of the SIAM Journal on Discrete Mathematics. He is a Fellow of the ACM and of SIAM.

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

Join us online

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.

Cancel

Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

×
Please fill in the required fields in your feedback submission.
×