An Evolver program for weighted Steiner trees

08/05/2020
by   Henrique Botelho, et al.
0

We present an algorithm to find near-optimal weighted Steiner minimal trees in the plane. The algorithm is implemented in Evolver programming language, which already contains many built-in energy minimisation routines. Some are invoked in the program, which enable it to consist of only 183 lines of source code. Our algorithm reproduces the physical experiment of a soap film detaching from connected pins towards a stable configuration. In the non-weighted case comparisons with GeoSteiner are drawn for terminals that form a pattern.

READ FULL TEXT
research
12/08/2020

Learning to Represent Programs with Heterogeneous Graphs

Program source code contains complex structure information, which can be...
research
10/03/2021

DeepSCC: Source Code Classification Based on Fine-Tuned RoBERTa

In software engineering-related tasks (such as programming language tag ...
research
02/25/2022

Multi-View Graph Representation for Programming Language Processing: An Investigation into Algorithm Detection

Program representation, which aims at converting program source code int...
research
09/09/2023

pun: Fun with Properties; Towards a Programming Language With Built-in Facilities for Program Validation

Property-based testing is a powerful method to validate program correctn...
research
04/13/2023

Kind Inference for the FreeST Programming Language

We present a kind inference algorithm for the FREEST programming languag...
research
07/16/2020

MaxSAT Evaluation 2020 – Benchmark: Identifying Maximum Probability Minimal Cut Sets in Fault Trees

This paper presents a MaxSAT benchmark focused on the identification of ...
research
09/20/2023

Design of Chain-of-Thought in Math Problem Solving

Chain-of-Thought (CoT) plays a crucial role in reasoning for math proble...

Please sign up or login with your details

Forgot password? Click here to reset