Your browser does not allow JavaScript!
JavaScript is necessary for the proper functioning of this website. Please enable JavaScript or use a modern browser.
Open Science Slovenia
Open Science
DiKUL
slv
|
eng
Search
Browse
New in RUL
About RUL
In numbers
Help
Sign in
Aproksimacijski algoritmi za reševanje problema najkrajšega hodnika : diplomsko delo
ID
Vrhovnik, Anže
(
Author
),
ID
Bosnić, Zoran
(
Mentor
)
More about this mentor...
PDF - Presentation file,
Download
(756,04 KB)
MD5: 3B972C039F4C3604237A9860D435EAAE
Image galllery
Language:
Slovenian
Keywords:
minimizacija dolžine hodnika
,
aproksimacijski algoritem
,
najkrajša pot v grafu
,
računalništvo
,
univerzitetni študij
,
diplomske naloge
Work type:
Undergraduate thesis
Typology:
2.11 - Undergraduate Thesis
Organization:
FRI - Faculty of Computer and Information Science
Place of publishing:
Ljubljana
Publisher:
A. Vrhovnik
Year:
2012
Number of pages:
[56] str.
PID:
20.500.12556/RUL-157369
UDC:
004(043.2)
COBISS.SI-ID:
9453908
Publication date in RUL:
26.05.2024
Views:
233
Downloads:
22
Metadata:
Cite this work
Plain text
BibTeX
EndNote XML
EndNote/Refer
RIS
ABNT
ACM Ref
AMA
APA
Chicago 17th Author-Date
Harvard
IEEE
ISO 690
MLA
Vancouver
:
Copy citation
Share:
Secondary language
Language:
English
Title:
Approximation algorithms for solving the minimal corridor problem
Keywords:
minimum-length corridor problem
,
approximation algorithm
,
shortest path in a graph
,
computer science
,
diploma
Similar documents
Similar works from RUL:
Similar works from other Slovenian collections:
Back