✦ LIBER ✦

An efficient minimum and maximum global snapshot algorithm

✍ Scribed by L.-B. Chen

Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 102 KB
Volume: 86
Category: Article
ISSN: 0020-0190
DOI: 10.1016/s0020-0190(02)00485-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Efficient Algorithm for Minimum-Weigh

An Efficient Algorithm for Minimum-Weight Bibranching

✍ J. Keijsper; R. Pendavingh 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 280 KB

Given a directed graph D=(V, A) and a set S V, a bibranching is a set of arcs B A that contains a v&(V "S) path for every v # S and an S&v path for every v # V "S. In this paper, we describe a primal dual algorithm that determines a minimum weight bibranching in a weighted digraph. It has running ti

An efficient heuristic algorithm for min

An efficient heuristic algorithm for minimum matching

✍ P. Grassberger; H. Freund 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 653 KB

Implementing an efficient minimum capaci

Implementing an efficient minimum capacity cut algorithm

✍ Hiroshi Nagamochi; Tadashi Ono; Toshihide Ibaraki 📂 Article 📅 1994 🏛 Springer-Verlag 🌐 English ⚖ 900 KB

An efficient algorithm to generate maxim

An efficient algorithm to generate maximum entropy distributions

✍ P. C. Basu; A. B. Templeman 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 827 KB

An efficient algorithm for the minimum c

An efficient algorithm for the minimum capacity cut problem

✍ M. Padberg; G. Rinaldi 📂 Article 📅 1990 🏛 Springer-Verlag 🌐 English ⚖ 757 KB

MaxSolver: An efficient exact algorithm

MaxSolver: An efficient exact algorithm for (weighted) maximum satisfiability

✍ Zhao Xing; Weixiong Zhang 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 327 KB