✦ LIBER ✦

Improved Algorithms for Some Competitive Location Centroid Problems on Paths, Trees and Graphs

✍ Scribed by Avivit Lazar, Arie Tamir

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An improved algorithm for the longest in

✍ Tetsuya Ishizeki; Yota Otachi; Koichi Yamazaki 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 181 KB

Generation of polynomial-time algorithms

✍ R. B. Borie 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 837 KB

Combinatorial algorithms for inverse abs

✍ Behrooz Alizadeh; R.E. Burkard 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 240 KB

The competitiveness of randomized algori

✍ Ying Teh Tsai; Chuan Yi Tang 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 373 KB

An improved algorithm for the distance c

✍ Arie Tamir 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 66 KB 👁 1 views

Dynamic programming algorithms for the c

✍ Jennifer A. Horne; J. Cole Smith 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB 👁 1 views