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
Problem polnjenja košev v povezavi z omejitvijo kardinalnosti : diplomsko delo
ID
Remic, Maja
(
Author
),
ID
Robič, Borut
(
Mentor
)
More about this mentor...
URL - Presentation file, Visit
http://eprints.fri.uni-lj.si/1386/1/Remic1.pdf
Image galllery
Language:
Slovenian
Keywords:
aproksimacijski algoritmi
,
primerjava
,
FFD
,
RFF
,
Zhangov algoritem
,
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:
[M. Remic]
Year:
2011
Number of pages:
43 str.
PID:
20.500.12556/RUL-25255
UDC:
004(043.2)
COBISS.SI-ID:
8451156
Publication date in RUL:
11.07.2014
Views:
1490
Downloads:
308
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
Keywords:
approximation algorithms
,
comparison
,
FFD
,
RFF
,
Zhang's algorithm
,
computer science
,
diploma
Similar documents
Similar works from RUL:
Similar works from other Slovenian collections:
Back