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
dctermshttp://purl.org/dc/terms/
n20http://localhost/temp/predkladatel/
n12http://purl.org/net/nknouf/ns/bibtex#
n8http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n4http://linked.opendata.cz/resource/domain/vavai/projekt/
n14http://linked.opendata.cz/resource/domain/vavai/subjekt/
n13http://linked.opendata.cz/ontology/domain/vavai/
n21https://schema.org/
n19http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F00216305%3A26210%2F12%3APU102952%21RIV13-GA0-26210___/
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#
n6http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n17http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n7http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F00216305%3A26210%2F12%3APU102952%21RIV13-GA0-26210___
rdf:type
skos:Concept n13:Vysledek
dcterms:description
Many NP-complete optimization problems may be approximately solved by stochastic or deterministic heuristic methods and it is necessary to find their efficient data representation to minimize iteration computational time. In this chapter, we will touch the Minimum Steiner Tree Problems in Graphs (or Network Steiner Tree Problem), which can be solved by heuristics based on the Minimum Spanning Tree Problem and/or the Shortest Path Problem using a binary heap that enables to implement a priority queue that substantially increases the algorithm efficiency. We will also show a Delaunay triangulation-based way of finding minimal networks connecting a set of given points in the Euclidean plane using straight lines (minimum spanning tree) and its more general case (Steiner minimum tree) where additional points can be considered. Finally, we will deal with visibility graphs, Voronoi diagrams and rapidly exploring trees and focus on their applications in robot motion planning, where the robot should pass aroun Many NP-complete optimization problems may be approximately solved by stochastic or deterministic heuristic methods and it is necessary to find their efficient data representation to minimize iteration computational time. In this chapter, we will touch the Minimum Steiner Tree Problems in Graphs (or Network Steiner Tree Problem), which can be solved by heuristics based on the Minimum Spanning Tree Problem and/or the Shortest Path Problem using a binary heap that enables to implement a priority queue that substantially increases the algorithm efficiency. We will also show a Delaunay triangulation-based way of finding minimal networks connecting a set of given points in the Euclidean plane using straight lines (minimum spanning tree) and its more general case (Steiner minimum tree) where additional points can be considered. Finally, we will deal with visibility graphs, Voronoi diagrams and rapidly exploring trees and focus on their applications in robot motion planning, where the robot should pass aroun
dcterms:title
Graph and Geometric Algorithms and Efficient Data Structures Graph and Geometric Algorithms and Efficient Data Structures
skos:prefLabel
Graph and Geometric Algorithms and Efficient Data Structures Graph and Geometric Algorithms and Efficient Data Structures
skos:notation
RIV/00216305:26210/12:PU102952!RIV13-GA0-26210___
n13:predkladatel
n14:orjk%3A26210
n3:aktivita
n16:P
n3:aktivity
P(GA102/09/1680)
n3:dodaniDat
n7:2013
n3:domaciTvurceVysledku
n8:1920863
n3:druhVysledku
n18:C
n3:duvernostUdaju
n9:S
n3:entitaPredkladatele
n19:predkladatel
n3:idSjednocenehoVysledku
138395
n3:idVysledku
RIV/00216305:26210/12:PU102952
n3:jazykVysledku
n17:eng
n3:klicovaSlova
Steiner tree, Voronoi diagram, Delaunay triangulation, visibility graph, rapidly exploring tree, binary heap
n3:klicoveSlovo
n6:Delaunay%20triangulation n6:Voronoi%20diagram n6:binary%20heap n6:visibility%20graph n6:rapidly%20exploring%20tree n6:Steiner%20tree
n3:kontrolniKodProRIV
[73480042C353]
n3:mistoVydani
Berlin (Germany)
n3:nazevEdiceCisloSvazku
Optimisation
n3:nazevZdroje
Zelinka, I., Snášel, V., Abraham, A. (eds.): Handbook of Optimization. From Classical to Modern Approach.
n3:obor
n15:BB
n3:pocetDomacichTvurcuVysledku
1
n3:pocetStranKnihy
1100
n3:pocetTvurcuVysledku
1
n3:projekt
n4:GA102%2F09%2F1680
n3:rokUplatneniVysledku
n7:2012
n3:tvurceVysledku
Šeda, Miloš
s:numberOfPages
23
n12:hasPublisher
Springer-Verlag
n21:isbn
978-3-642-30503-0
n20:organizacniJednotka
26210