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

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

Namespace Prefixes

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

Statements

Subject Item
n2:RIV%2F00216305%3A26210%2F04%3APU47004%21RIV11-MSM-26210___
rdf:type
n16: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 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.
dcterms: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
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
skos:notation
RIV/00216305:26210/04:PU47004!RIV11-MSM-26210___
n4:aktivita
n13:V n13:Z
n4:aktivity
V, Z(MSM 261100009), Z(MSM 262100024)
n4:dodaniDat
n19:2011
n4:domaciTvurceVysledku
n14:1920863
n4:druhVysledku
n6:D
n4:duvernostUdaju
n12:S
n4:entitaPredkladatele
n5:predkladatel
n4:idSjednocenehoVysledku
552883
n4:idVysledku
RIV/00216305:26210/04:PU47004
n4:jazykVysledku
n21:eng
n4:klicovaSlova
Steiner tree, minimum spanning tree, Delaunay triangulation, heuristic
n4:klicoveSlovo
n10:Delaunay%20triangulation n10:minimum%20spanning%20tree n10:heuristic n10:Steiner%20tree
n4:kontrolniKodProRIV
[762335D95AE3]
n4:mistoKonaniAkce
Bratislava
n4:mistoVydani
Bratislava (Slovakia)
n4:nazevZdroje
Proceedings of the 3rd International Conference Aplimat
n4:obor
n20:BB
n4:pocetDomacichTvurcuVysledku
1
n4:pocetTvurcuVysledku
1
n4:rokUplatneniVysledku
n19:2004
n4:tvurceVysledku
Šeda, Miloš
n4:typAkce
n9:WRD
n4:zahajeniAkce
2004-02-03+01:00
n4:zamer
n17:MSM%20262100024 n17:MSM%20261100009
s:numberOfPages
6
n15:hasPublisher
Slovenská technická univerzita v Bratislave
n11:isbn
80-227-1995-1
n18:organizacniJednotka
26210