An effective crossing minimisation heuristic based on star insertion

04/26/2018
by   Kieran Clancy, et al.
0

We present a new heuristic method for minimising crossings in a graph. The method is based upon repeatedly solving the so-called star insertion problem and has several desirable characteristics for practical use. We introduce the method, discuss some aspects of algorithm design for our implementation, and provide some experimental results. The results indicate that our method compares well to existing methods, particularly for dense graphs, and is able to obtain some of the best known heuristic solutions to well-known instances.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/27/2023

Heuristic Approaches to Obtain Low-Discrepancy Point Sets via Subset Selection

Building upon the exact methods presented in our earlier work [J. Comple...
research
11/19/2018

Reinforcement Learning with A* and a Deep Heuristic

A* is a popular path-finding algorithm, but it can only be applied to th...
research
11/05/2019

A Heuristic Algorithm Based on Tour Rebuilding Operator for the Traveling Salesman Problem

TSP (Traveling Salesman Problem), a classic NP-complete problem in combi...
research
08/30/2018

A Heuristic Approach towards Drawings of Graphs with High Crossing Resolution

The crossing resolution of a non-planar drawing of a graph is the value ...
research
09/25/2018

Next Generation of Star Patterns

In this paper we present two new ideas for generating star patterns and ...
research
08/25/2021

Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics

We present a thorough experimental evaluation of several crossing minimi...
research
01/03/2005

Portfolio selection using neural networks

In this paper we apply a heuristic method based on artificial neural net...

Please sign up or login with your details

Forgot password? Click here to reset