Title: Incremental Algorithms for the Minimum Cost Flow Problem
Abstract: Incremental algorithms may save computational time to solve different network flow problems. Let us consider a network in which we already established a minimum cost flow. We describe and solve the problem of establishing a minimum cost flow in this network after inserting a new arc and after deleting an existent arc. We focus on these problems because they arise in practice. Key-Words: Network flow; Network algorithms; Minimum cost flow problem; Incremental computation.
Publication Year: 2011
Publication Date: 2011-01-01
Language: en
Type: article
Access and Citation
Cited By Count: 1
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot