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

A faster optimal algorithm for the measure problem

โœ Scribed by Stephan Olariu; Zhaofang Wen; Weixiong Zhang

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
238 KB
Volume
17
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

๐Ÿ“œ 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

A faster polynomial algorithm for the un
A faster polynomial algorithm for the unbalanced Hitchcock transportation problem
โœ Ulrich Brenner ๐Ÿ“‚ Article ๐Ÿ“… 2008 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 320 KB

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

A faster off-line algorithm for the TCP
A faster off-line algorithm for the TCP acknowledgement problem
โœ John Noga; Steve Seiden; Gerhard J. Woeginger ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 48 KB

In a recent paper [Proceedings of STOC'98, 1998, pp. 389-398], Dooly, Goldman and Scott study a problem that is motivated by the networking problem of dynamically adjusting delays of acknowledgements in the Transmission Control Protocol (TCP). Among other results, they give an O(n 2 ) off-line algor