✦ LIBER ✦

The lattice covering time problem for sites visitedk-times

✍ Scribed by Claudio R. Mirasso; Héctor O. Mártin

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Universality in the lattice-covering tim

✍ Nemirovsky, A. M.; Mártin, H. O.; Coutinho-Filho, M. D. 📂 Article 📅 1990 🏛 The American Physical Society 🌐 English ⚖ 368 KB

Some exact results for the lattice cover

✍ Carlos S.O. Yokoi; A. Hernández-Machado; L. Ramírez-Piscina 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 337 KB

The time constrained maximal covering sa

✍ Naji-Azimi, Zahra; Salari, Majid 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 608 KB

Linear time algorithms for approximating

✍ Guang Xu; Yang Yang; Jinhui Xu 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 413 KB

Polynomial time approximation schemes fo

✍ Chen Liao; Shiyan Hu 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 409 KB

The maximum covering problem with travel

✍ Berman, Oded; Hajizadeh, Iman; Krass, Dmitry 📂 Article 📅 2013 🏛 Taylor and Francis Group 🌐 English ⚖ 525 KB