Abstract
Abstract Calibrations are a possible tool to validate the minimality of a certain candidate. They have been introduced in the context of minimal surfaces and adapted to the case of the Steiner problem in several variants. Our goal is to compare the different notions of calibrations for the Steiner problem and for planar minimal partitions that are already present in the literature. The paper is then complemented with remarks on the convexification of the problem, on nonexistence of calibrations and on calibrations in families.
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.
