bonndata catalog
Thumbnail for Triangular Grid Instances for the Euclidean Steiner Tree Problem

Triangular Grid Instances for the Euclidean Steiner Tree Problem

Open this dataset in the live repository

Important usage condition: Use and redistribution are governed by CC BY 4.0. Review and comply with the license before using the data.
Persistent identifier
doi:10.60507/FK2/XLGFI4
Published version
1.0
Publication date
2024-05-24
License
CC BY 4.0

Description

This data set contains triangular nxk arrays with 2<=n, k<=10 using the TSPLIB-format. The instances where generated as part of the master's thesis of Daphne Rohrssen written 2022 under the supervision of Stefan Hougardy at the University of Bonn. Some of these instances are very hard to solve exactly for GeoSteiner 5.1. For example the 4x9 instance with 36 vertices needs more than 10 days of CPU time. SCIP-JACK 2.1 solves this instance within 20 minutes. However, one should be aware of the fact that both codes have numerical problems and cannot guarantee optimality of the solutions. With SCIP-JACK this seems to happen more often than with GeoSteiner.

Creators

Keywords

Euclidean Steiner Tree

Files

Before downloading: Use and redistribution are governed by CC BY 4.0. Review and comply with the license before using the data.
FileTypeBytesChecksum
triangular_instances.zipapplication/zip37904MD5 fc973044f4ca1d6cb3722a6c995fd7b5
readme.txttext/plain1548MD5 2f6dab94e3374ca7e5eab320ff58d670

Citation

Hougardy, Stefan, 2024-05-24, Triangular Grid Instances for the Euclidean Steiner Tree Problem, doi:10.60507/FK2/XLGFI4, V1.0

Additional Dataverse fields

Id227
Dataset Typedataset
Internal Version Number15
Latest Version Publishing StateRELEASED
Deaccession LinkNot supplied
Release Time2024-05-24T07:53:17Z
Create Time2024-05-21T13:05:23Z
Citation Date2024-05-24
File Access RequestTrue

Export metadata

Static metadata exports available for this published dataset version:

Complete Dataverse metadata

Citation Metadata

Title title
Triangular Grid Instances for the Euclidean Steiner Tree Problem
Author author
  1. Author Name
    Hougardy, Stefan
    Author Affiliation
    University of Bonn
    Author Identifier Scheme
    ORCID
    Author Identifier
    0000-0001-8656-3418
Dataset Contact datasetContact
  1. Dataset Contact Name
    Hougardy, Stefan
    Dataset Contact Affiliation
    University of Bonn
    Dataset Contact Email
    shougard@uni-bonn.de
Ds Description dsDescription
  1. Ds Description Value
    This data set contains triangular nxk arrays with 2<=n, k<=10 using the TSPLIB-format. The instances where generated as part of the master's thesis of Daphne Rohrssen written 2022 under the supervision of Stefan Hougardy at the University of Bonn. Some of these instances are very hard to solve exactly for GeoSteiner 5.1. For example the 4x9 instance with 36 vertices needs more than 10 days of CPU time. SCIP-JACK 2.1 solves this instance within 20 minutes. However, one should be aware of the fact that both codes have numerical problems and cannot guarantee optimality of the solutions. With SCIP-JACK this seems to happen more often than with GeoSteiner.
Subject subject
  1. Computer and Information Science
  2. Mathematical Sciences
Free Keyword freeKeyword
  1. Free Keyword Value
    Euclidean Steiner Tree
Depositor depositor
Hougardy, Stefan
Date Of Deposit dateOfDeposit
2024-05-21

Expected crawler behaviour

Use a stable, truthful User-Agent with product/version and a working contact URL. Across all IP addresses and HTTP connections used by one crawler identity, allow no more than 5 requests in flight and wait at least 20 seconds between request starts. Crawl URLs listed in the catalog sitemap, including file pages and download URLs when they are published, use conditional requests, honor Retry-After, and apply exponential backoff after errors.

The welcome page may link to the interactive repository for human navigation. Automated clients must not treat that human link as a catalog crawl target.

Read the live machine-readable crawler policy before and during a crawl. Stop crawling when it reports CPU or memory utilization at or above 80% and 80% respectively.