Paper Info
Title
Another exploration problem.
Abstract
An expedition party has to explore deep inside of a jungle. Each member can carry a pack of food that lasts the member exactly 2c days, and each member can walk one unit distance in c days. For a party of n members, let d(n) denote the distance from the base camp to the farthest point at least one member of the party can reach. We present a few values of d(n) and bounds on d(n). Several problems are posed.
Year
DOI
Venue
2016
10.1016/j.disc.2016.01.001
Discrete Mathematics
Keywords
DocType
Volume
Jeep problem,Exploration problem,Reverse plan
Journal
339
Issue
ISSN
Citations 
5
0012-365X
0
PageRank 
References 
Authors
0.34
0
2
Name
Order
Citations
PageRank
Takayasu Kuwata141.47
Hiroshi Maehara2152114.17