This HTML5 document contains 40 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
n10http://localhost/temp/predkladatel/
n4http://purl.org/net/nknouf/ns/bibtex#
n15http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n6http://linked.opendata.cz/ontology/domain/vavai/
n16http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216305%3A26210%2F07%3APU71534%21RIV10-MSM-26210___/
n18http://linked.opendata.cz/resource/domain/vavai/zamer/
n14https://schema.org/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n7http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n17http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n20http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n5http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216305%3A26210%2F07%3APU71534%21RIV10-MSM-26210___
rdf:type
n6:Vysledek skos:Concept
dcterms: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 being NP-hard, polynomial-time approximations or heuristics are required. There are many rather complex heuristics based, e.g., on enumerating full topologies and consuming long time for computations for large instances. In this paper, we applied to use tools of computational geometry, especially the properties of Delaunay triangulation, a well-known geometric structure, and combine them with insertion heuristics based on the construction of the Euclidean minimum spanning tree. Thus an algorithm could be proposed that is very efficient and fast. Experiments confirmed that computations by this algorithm generate very good results in a reasonable amount of time, even for large instances of the studied problem. 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 being NP-hard, polynomial-time approximations or heuristics are required. There are many rather complex heuristics based, e.g., on enumerating full topologies and consuming long time for computations for large instances. In this paper, we applied to use tools of computational geometry, especially the properties of Delaunay triangulation, a well-known geometric structure, and combine them with insertion heuristics based on the construction of the Euclidean minimum spanning tree. Thus an algorithm could be proposed that is very efficient and fast. Experiments confirmed that computations by this algorithm generate very good results in a reasonable amount of time, even for large instances of the studied problem.
dcterms:title
An Improved Insertion Heuristic for the Euclidean Minimum Steiner Tree Problem An Improved Insertion Heuristic for the Euclidean Minimum Steiner Tree Problem
skos:prefLabel
An Improved Insertion Heuristic for the Euclidean Minimum Steiner Tree Problem An Improved Insertion Heuristic for the Euclidean Minimum Steiner Tree Problem
skos:notation
RIV/00216305:26210/07:PU71534!RIV10-MSM-26210___
n3:aktivita
n12:Z
n3:aktivity
Z(MSM0021630518)
n3:dodaniDat
n5:2010
n3:domaciTvurceVysledku
n15:1920863
n3:druhVysledku
n20:C
n3:duvernostUdaju
n11:S
n3:entitaPredkladatele
n16:predkladatel
n3:idSjednocenehoVysledku
409327
n3:idVysledku
RIV/00216305:26210/07:PU71534
n3:jazykVysledku
n17:eng
n3:klicovaSlova
Steiner tree, spanning tree, Delaunay triangulation, time complexity, NP-hard problems
n3:klicoveSlovo
n7:NP-hard%20problems n7:Delaunay%20triangulation n7:spanning%20tree n7:time%20complexity n7:Steiner%20tree
n3:kontrolniKodProRIV
[E8466D8E20E5]
n3:mistoVydani
Wien (Austria)
n3:nazevEdiceCisloSvazku
DAAAM International Scientific Book
n3:nazevZdroje
Katalinic, B. (ed.): DAAAM International Scientific Book 2007
n3:obor
n9:BB
n3:pocetDomacichTvurcuVysledku
1
n3:pocetStranKnihy
686
n3:pocetTvurcuVysledku
1
n3:rokUplatneniVysledku
n5:2007
n3:tvurceVysledku
Šeda, Miloš
n3:zamer
n18:MSM0021630518
s:numberOfPages
12
n4:hasPublisher
DAAAM International
n14:isbn
3-901509-60-7
n10:organizacniJednotka
26210