✦ LIBER ✦

A fast algorithm for the minimax flow problem with 01 weights

✍ Scribed by C.-C. Han

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 398 KB
Volume: 10
Category: Article
ISSN: 0893-9659
DOI: 10.1016/s0893-9659(96)00103-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An iterative algorithm for the multifaci

An iterative algorithm for the multifacility minimax location problem with euclidean distances

✍ Christakis Charalambous 📂 Article 📅 1981 🏛 John Wiley and Sons 🌐 English ⚖ 509 KB

A fast algorithm for the longest-common-

A fast algorithm for the longest-common-subsequence problem

✍ Amar Mukhopadhyay 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 696 KB

A fast algorithm for the linear multiple

A fast algorithm for the linear multiple-choice knapsack problem

✍ Krzysztof Dudziński; Stanisław Walukiewicz 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 256 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 simple approximation algorithm for the

A simple approximation algorithm for the weighted matching problem

✍ Doratha E Drake; Stefan Hougardy 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 61 KB

We present a linear time approximation algorithm with a performance ratio of 1/2 for finding a maximum weight matching in an arbitrary graph. Such a result is already known and is due to Preis [

A New Algorithm for the Maximum-Weight C

A New Algorithm for the Maximum-Weight Clique Problem

✍ Patric R.J. Östergård 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 72 KB