✦ LIBER ✦

Combinatorial approximation algorithms: a comparative review

✍ Scribed by Gerhard J. Woeginger

Book ID: 103877642
Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 150 KB
Volume: 33
Category: Article
ISSN: 0167-6377
DOI: 10.1016/j.orl.2004.03.010

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Algorithms and Combinatorics] Combinato

[Algorithms and Combinatorics] Combinatorial Optimization Volume 21 || Approximation Algorithms

✍ Korte, Bernhard; Vygen, Jens 📂 Article 📅 2011 🏛 Springer Berlin Heidelberg ⚖ 495 KB

Approximation algorithms for combinatori

Approximation algorithms for combinatorial fractional programming problems

✍ Satoru Hashizume; Masao Fukushima; Naoki Katoh; Toshihide Ibaraki 📂 Article 📅 1987 🏛 Springer-Verlag 🌐 English ⚖ 528 KB

Approximation algorithms for combinatori

Approximation algorithms for combinatorial multicriteria optimization problems

✍ M. Ehrgott 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 228 KB

Approximation algorithms for combinatori

Approximation algorithms for combinatorial multicriteria optimization problems

✍ Matthias Ehrgott 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 235 KB

Combinatorial Approximation Algorithms f

Combinatorial Approximation Algorithms for Generalized Flow Problems

✍ Jeffrey D Oldham 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 226 KB

Generalized network flow problems generalize normal network flow problems by specifying a flow multiplier µ v w for each arc v w . For every unit of flow entering the arc, µ v w units of flow exit. We present a strongly polynomial algorithm for a single-source generalized shortest paths problem, usi

Tight approximation bounds for combinato

Tight approximation bounds for combinatorial frugal coverage algorithms

✍ Ioannis Caragiannis, Christos Kaklamanis… 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 579 KB