๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A faster polynomial algorithm for the unbalanced Hitchcock transportation problem

โœ Scribed by Ulrich Brenner

Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
320 KB
Volume
36
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

โœฆ Synopsis

We present a new algorithm for the Hitchcock transportation problem. On instances with n sources and k sinks, our algorithm has a worst-case running time of O(nk 2 (log n + k log k)). It closes a gap between algorithms with running time linear in n but exponential in k and a polynomialtime algorithm with running time O(nk 2 log 2 n).

๐Ÿ“œ SIMILAR VOLUMES

A Faster Algorithm for the Inverse Spann
A Faster Algorithm for the Inverse Spanning Tree Problem
โœ Ravindra K. Ahuja; James B. Orlin ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 149 KB

In this paper, we consider the inverse spanning tree problem. Given an undi-0 ลฝ 0 0 . rected graph G s N , A with n nodes, m arcs, an arc cost vector c, and a spanning tree T 0 , the inverse spanning tree problem is to perturb the arc cost vector c to a vector d so that T 0 is a minimum spanning tre