Abstract
We discuss some of the problems that arise when two teams attempt to rendezvous on a star graph while minimizing a cost arising from three components: movement, time and searching. The intuitive strategy is to meet at the center, but in some circumstances this strategy is not optimal and the participants must employ the alternative strategy of meeting at a node. There is also the question of what tactics to employ on the first move. We derive procedures by which two participants can arrive at an optimal solution.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
