✦ LIBER ✦

An Incremental Algorithm for the Maximum Flow Problem

✍ Scribed by S. Kumar; P. Gupta

Book ID: 110438215
Publisher: Springer Netherlands
Year: 2003
Tongue: English
Weight: 129 KB
Volume: 2
Category: Article
ISSN: 1570-1166
DOI: 10.1023/a:1023607406540

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the maximum capacity augmentation alg

On the maximum capacity augmentation algorithm for the maximum flow problem

✍ Donald Goldfarb; Jianxiu Hao 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 489 KB

A self-stabilizing algorithm for the max

A self-stabilizing algorithm for the maximum flow problem

✍ Sukumar Ghosh; Arobinda Gupta; Sriram V. Pemmaraju 📂 Article 📅 1997 🏛 Springer-Verlag 🌐 English ⚖ 609 KB

An exact algorithm for the maximum cliqu

An exact algorithm for the maximum clique problem

✍ Randy Carraghan; Panos M. Pardalos 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 358 KB

An algorithm for the maximum revenue job

An algorithm for the maximum revenue jobshop problem

✍ Michal Penn; Tal Raviv 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 226 KB

A faster polynomial algorithm for the co

A faster polynomial algorithm for the constrained maximum flow problem

✍ Cenk Çalışkan 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 447 KB

A capacity scaling algorithm for the con

A capacity scaling algorithm for the constrained maximum flow problem

✍ Ravindra K. Ahuja; James B. Orlin 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 970 KB

## Abstract The constrained maximum flow problem is to send the maximum possible flow from a source node s to a sink node t in a directed network subject to a budget constraint that the cost of flow is no more than __D__. In this paper, we consider two versions of this problem: (i) when the cost of