Network Flow Algorithms

US $104.47
ApproximatelyS$ 136.07
Condition:
Brand New
Breathe easy. Returns accepted.
Shipping:
US $27.14 (approx S$ 35.35) Standard Shipping from outside US.
Located in: Fukui, Japan
This item includes applicable import fees—you won’t pay anything extra after checkout.
Import fees:
Includes import fees
Delivery:
Estimated between Tue, 25 Nov and Mon, 1 Dec to 94104
Estimated delivery dates - opens in a new window or tab include seller's handling time, origin ZIP Code, destination ZIP Code and time of acceptance and will depend on shipping service selected and receipt of cleared paymentcleared payment - opens in a new window or tab. Delivery times may vary, especially during peak periods.
Returns:
60 days return. Buyer pays for return shipping. If you use an eBay shipping label, it will be deducted from your refund amount.
Coverage:
Read item description or contact seller for details. See all detailsSee all details on coverage
(Not eligible for eBay purchase protection programmes)
Seller assumes all responsibility for this listing.
eBay item number:397248980650

Item specifics

Condition
Brand New: A new, unread, unused book in perfect condition with no missing or damaged pages. See all condition definitionsopens in a new window or tab
subject_code
UMB
target_audience
Professional and scholarly
is_adult_product
false
edition_number
1
binding
paperback
MPN
N/A
batteries_required
false
manufacturer
Cambridge University Press
Brand
Cambridge University Press
number_of_items
1
pages
326
genre
COMPUTERS
publication_date
2019-09-30T00:00:01Z
unspsc_code
55101500
batteries_included
false
ISBN
9781316636831
Category

About this product

Product Identifiers

Publisher
Cambridge University Press
ISBN-10
1316636836
ISBN-13
9781316636831
eBay Product ID (ePID)
14038481636

Product Key Features

Number of Pages
326 Pages
Publication Name
Network Flow Algorithms
Language
English
Publication Year
2019
Subject
Programming / Algorithms, Operations Research, General, System Theory
Type
Textbook
Subject Area
Computers, Technology & Engineering, Science
Author
David P. Williamson
Format
Trade Paperback

Dimensions

Item Height
0.7 in
Item Weight
17 Oz
Item Length
8.9 in
Item Width
6 in

Additional Product Features

Intended Audience
Scholarly & Professional
LCCN
2019-011352
Reviews
'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
Dewey Edition
23
Illustrated
Yes
Dewey Decimal
003
Table Of Content
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.
Synopsis
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., This comprehensive text and reference for graduate students and professionals in theoretical computer science, operations research, and discrete math offers an up-to-date, unified view of efficient combinatorial algorithms for a wide variety of network flow problems, including recent work on computing electrical flows and their applications.
LC Classification Number
T57.85.W56 2019

Item description from the seller

About this seller

kobaryo-88gmail

99% positive feedback304 items sold

Joined Oct 2024

Detailed Seller Ratings

Average for the last 12 months
Accurate description
5.0
Reasonable shipping cost
4.9
Shipping speed
5.0
Communication
4.9

Seller feedback (114)

All ratingsselected
Positive
Neutral
Negative
  • a***f (279)- Feedback left by buyer.
    Past 6 months
    Verified purchase
    Absolutely flawless transaction from start to finish! The communication was fast, clear, and friendly — truly above and beyond. My item was shipped lightning-fast and arrived exactly as described, perfectly packaged. The price was unbeatable, and the overall experience far exceeded my expectations. I would choose this seller over anyone else, even local options, without hesitation. If you’re looking for top-tier service, this is the person to buy from. Highly recommended to everyone!
  • m***l (36)- Feedback left by buyer.
    Past 6 months
    Verified purchase
    Yay, so happy with this purchase!!! All arrived very very well packaged and in new condition, as described!!!! Great good price and in its condition sealed clear plastic outer packaging, I would recommend this seller to anyone. A+++++ Thank you so much!!!
  • 0***k (6)- Feedback left by buyer.
    Past 6 months
    Verified purchase
    It came in perfect condition and it came exactly within the timeframe. It was packaged very well with two layers of bubble wrap. The item was exactly what I ordered. The value was a bit high but considering that I couldn’t find it literally anywhere else it’s fair.