About: A Delaunay Triangulation-Based Heuristic for the Steiner Tree Problem in the Euclidean Plane     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • The Euclidean Steiner Tree Problem is to find a shortest network spanning a set of fixed points in the plane, allowing the addition of auxiliary points to the set. The problem is NP-hard, so polynomial-time approximations or heuristics are desired. In this paper, a modification of the Steiner insertion heuristic is presented and computational results for benchmarks from OR-Library are discussed.
  • The Euclidean Steiner Tree Problem is to find a shortest network spanning a set of fixed points in the plane, allowing the addition of auxiliary points to the set. The problem is NP-hard, so polynomial-time approximations or heuristics are desired. In this paper, a modification of the Steiner insertion heuristic is presented and computational results for benchmarks from OR-Library are discussed. (en)
Title
  • A Delaunay Triangulation-Based Heuristic for the Steiner Tree Problem in the Euclidean Plane
  • A Delaunay Triangulation-Based Heuristic for the Steiner Tree Problem in the Euclidean Plane (en)
skos:prefLabel
  • A Delaunay Triangulation-Based Heuristic for the Steiner Tree Problem in the Euclidean Plane
  • A Delaunay Triangulation-Based Heuristic for the Steiner Tree Problem in the Euclidean Plane (en)
skos:notation
  • RIV/00216305:26210/04:PU47004!RIV11-MSM-26210___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • V, Z(MSM 261100009), Z(MSM 262100024)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 552883
http://linked.open...ai/riv/idVysledku
  • RIV/00216305:26210/04:PU47004
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Steiner tree, minimum spanning tree, Delaunay triangulation, heuristic (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [762335D95AE3]
http://linked.open...v/mistoKonaniAkce
  • Bratislava
http://linked.open...i/riv/mistoVydani
  • Bratislava (Slovakia)
http://linked.open...i/riv/nazevZdroje
  • Proceedings of the 3rd International Conference Aplimat
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Šeda, Miloš
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
http://linked.open...n/vavai/riv/zamer
number of pages
http://purl.org/ne...btex#hasPublisher
  • Slovenská technická univerzita v Bratislave
https://schema.org/isbn
  • 80-227-1995-1
http://localhost/t...ganizacniJednotka
  • 26210
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 41 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software