✦ LIBER ✦

Efficient algorithms for the sum selection problem and maximum sums problem

✍ Scribed by Tien-Ching Lin; D.T. Lee

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improved algorithms for the maximum-sums

✍ Chih-Huai Cheng; Kuan-Yu Chen; Wen-Chin Tien; Kun-Mao Chao 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 213 KB

Fast parallel algorithms for the maximum

✍ Zhaofang Wen 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 414 KB

Efficient Algorithms for k Maximum Sums

✍ Fredrik Bengtsson; Jingsen Chen 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 191 KB

Efficient Approximation Algorithms for t

✍ Cristina Bazgan; Miklos Santha; Zsolt Tuza 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 117 KB

Priority algorithms for the subset-sum p

✍ Yuli Ye; Allan Borodin 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 732 KB

Efficient labelling algorithms for the m

✍ Federico Malucelli; Thomas Ottmann; Daniele Pretolani 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 336 KB