Algorithms and Complexity of Generalized River Crossing Problems
Three men, each with a sister, must cross a river using a boat which can carry only two people, so that a woman whose brother is not present is never left in the company of another man. This is a very famous problem appeared in Latin book “Problems to Sharpen the Young,” one of the earliest collections on recreational mathematics. This paper considers a generalization of such “River-Crossing Problems.” It shows that the problem is NP-hard if the boat size is three, and a large class of sub-problems can be solved in polynomial time if the boat size is two. It’s also conjectured that determining whether a river crossing problem has a solution without bounding the number of transportations, can be solved in polynomial time even when the size of the boat is large.
KeywordsPolynomial Time Vertex Cover Left Bank River Crossing Famous Problem
Unable to display preview. Download preview PDF.
- 1.Bahls, P.: The wolf, the goat, and the cabbage: A modern twist on a classical problem, http://facstaff.unca.edu/pbahls/talks/WGC.pdf
- 3.Borndörfer, R., Grötschel, M., Löbel, A.: Alcuin’s transportation problems and integer programming, Preprint SC-95-27, Konrad-Zuse-Zentrum für Informationstechnik Berlin (1995)Google Scholar
- 6.Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman And Company (1979)Google Scholar
- 7.Heeffer, A.: Alcuin, http://logica.ugent.be/albrecht/alcuin.pdf
- 9.Peterson, I.: Tricky crossings, Science News Online 164(24), http://web.archive.org/web/20040603203306/http://www.sciencenews.org/articles/20031213/mathtrek.asp (retrieved February 7, 2008)
- 11.Trevisan, L.: Graph Partitioning and Expanders, Stanford University — CS359G, Lecture 6 (2011), http://theory.stanford.edu/~trevisan/cs359g/
- 12.Propositiones ad Acuendos Juvenes, Wikipedia, the free encyclopediaGoogle Scholar