✦ LIBER ✦

An approximation algorithm for the general max-min resource sharing problem

✍ Scribed by Klaus Jansen

Publisher: Springer-Verlag
Year: 2005
Tongue: English
Weight: 225 KB
Volume: 106
Category: Article
ISSN: 0025-5610
DOI: 10.1007/s10107-005-0669-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A polynomial algorithm for solving a gen

A polynomial algorithm for solving a general max-min fairness problem

✍ Tomaszewski, Artur 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 806 KB

Approximation schemes for the Min-Max St

Approximation schemes for the Min-Max Starting Time Problem

✍ Leah Epstein; Tamir Tassa 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 193 KB

The general trapezoidal algorithm for st

The general trapezoidal algorithm for strongly regular max–min matrices

✍ Martin Gavalec 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 172 KB

The problem of the strong regularity for square matrices over a general max-min algebra is considered. An O(n 2 log n) algorithm for recognition of the strong regularity of a given n × n matrix is proposed. The algorithm works without any restrictions on the underlying max-min algebra, concerning th

An approximation algorithm for the gener

An approximation algorithm for the generalized assignment problem

✍ David B. Shmoys; Éva Tardos 📂 Article 📅 1993 🏛 Springer-Verlag 🌐 English ⚖ 898 KB

A randomized algorithm for the min-max s

A randomized algorithm for the min-max selecting items problem with uncertain weights

✍ Adam Kasperski; Paweł Zieliński 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 311 KB

An algorithm for the resource constraine

An algorithm for the resource constrained shortest path problem

✍ J. E. Beasley; N. Christofides 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 812 KB