Minimizers of the Maximum Distance Problem via an Analyst's Traveling Salesperson Algorithm
Enrique Alvarado, Silvia Ghinassi, Lisa Naples
TL;DR
This paper introduces bounds for the length of solutions to the Maximum Distance Problem using a novel approach based on an Analyst's Traveling Salesperson Algorithm, linking geometric sums to solution length.
Contribution
It presents a new method to bound the minimizers of the Maximum Distance Problem through an innovative algorithmic approach.
Findings
Established upper and lower bounds for the problem
Linked geometric sums to minimizer lengths
Proposed an algorithmic framework for analysis
Abstract
We provide an upper and lower bound for the length of Maximum Distance Problem minimizers in terms of a finite scale geometric square sum.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFacility Location and Emergency Management · Complexity and Algorithms in Graphs · Vehicle Routing Optimization Methods