✦ LIBER ✦

The Ferry Cover Problem

✍ Scribed by Michael Lampis; Valia Mitsou

Book ID: 105915008
Publisher: Springer
Year: 2008
Tongue: English
Weight: 312 KB
Volume: 44
Category: Article
ISSN: 1433-0490
DOI: 10.1007/s00224-008-9107-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A reduced integer programming model for

A reduced integer programming model for the ferry scheduling problem

✍ Daniel Karapetyan, Abraham P. Punnen 📂 Article 📅 2012 🏛 Springer-Verlag 🌐 English ⚖ 488 KB

The p-cover problem

✍ Zvi Drezner 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 172 KB

The Ferry

✍ Cross, Amy 📂 Fiction 📅 2015 🌐 English ⚖ 71 KB

The Ferry

✍ Cross, Amy 📂 Fiction 📅 2015 🌐 English ⚖ 73 KB

The Ferry

✍ C. Stephen Finley 📂 Article 📅 1985 ⚖ 77 KB

Covering Graphs: The Covering Problem So

Covering Graphs: The Covering Problem Solved

✍ Yair Caro; Raphael Yuster 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 238 KB

For every fixed graph H, we determine the H-covering number of K n , for all n>n 0 (H ). We prove that if h is the number of edges of H, and gcd(H )=d is the greatest common divisor of the degrees of H, then there exists n 0 =n 0 (H ), such that for all n>n 0 , Our main tool in proving this result