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

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

Namespace Prefixes

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

Statements

Subject Item
n2:RIV%2F00216305%3A26210%2F01%3APU21379%21RIV%2F2002%2FMSM%2F262102%2FN
rdf:type
n3: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, 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, the Steiner insertion heuristic is presented and computational results for benchmarks from OR-Library are discussed.
dcterms:title
Insertion Heuristic for the Euclidean Steiner Tree Problem Insertion Heuristic for the Euclidean Steiner Tree Problem
skos:prefLabel
Insertion Heuristic for the Euclidean Steiner Tree Problem Insertion Heuristic for the Euclidean Steiner Tree Problem
skos:notation
RIV/00216305:26210/01:PU21379!RIV/2002/MSM/262102/N
n5:strany
71-76
n5:aktivita
n21:Z
n5:aktivity
Z(MSM 261100009)
n5:dodaniDat
n12:2002
n5:domaciTvurceVysledku
n8:4084195 n8:1920863
n5:druhVysledku
n16:D
n5:duvernostUdaju
n6:S
n5:entitaPredkladatele
n11:predkladatel
n5:idSjednocenehoVysledku
683074
n5:idVysledku
RIV/00216305:26210/01:PU21379
n5:jazykVysledku
n14:eng
n5:klicovaSlova
Steiner tree problem, Delaunay triangulation, heuristic
n5:klicoveSlovo
n9:heuristic n9:Delaunay%20triangulation n9:Steiner%20tree%20problem
n5:kontrolniKodProRIV
[D295BEAA37D8]
n5:mistoKonaniAkce
Velké Losiny
n5:mistoVydani
Ostrava
n5:nazevZdroje
Proceedings of the XXIIIrd International Colloquium Advanced Simulation of Systems ASIS 2001
n5:obor
n20:BB
n5:pocetDomacichTvurcuVysledku
2
n5:pocetTvurcuVysledku
2
n5:pocetUcastnikuAkce
0
n5:pocetZahranicnichUcastnikuAkce
0
n5:rokUplatneniVysledku
n12:2001
n5:tvurceVysledku
Nečas, Pavel Šeda, Miloš
n5:typAkce
n15:CST
n5:zahajeniAkce
2001-09-11+02:00
n5:zamer
n13:MSM%20261100009
s:numberOfPages
6
n19:hasPublisher
MARQ Ostrava
n17:isbn
80-85988-61-5
n18:organizacniJednotka
26210