✦ LIBER ✦

A faster version of the ASG algorithm

✍ Scribed by N.L. Boland; A.T. Ernst; C.J. Goh; A.I. Mees

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 300 KB
Volume: 7
Category: Article
ISSN: 0893-9659
DOI: 10.1016/0893-9659(94)90066-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Fast Version of the Schur–Cohn Algorit

A Fast Version of the Schur–Cohn Algorithm

✍ Cyril Brunie; Philippe Saux Picart 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 180 KB

A conceptual version of the K-means algo

A conceptual version of the K-means algorithm

✍ H. Ralambondrainy 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 680 KB

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 algorithm for the two-center de

A faster algorithm for the two-center decision problem

✍ John Hershberger 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 569 KB

A faster algorithm for the maximum weigh

A faster algorithm for the maximum weighted tardiness problem

✍ Malcolm C. Fields; Greg N. Frederickson 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 503 KB

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