Hybridization of greedy algorithms and quicksort

Nina Vehovec (2017) Hybridization of greedy algorithms and quicksort. EngD thesis.

Preview

Abstract

The greedy method is one of the most commonly used techniques in algorithm design and there are many different optimizations available. This thesis presents one of them. Our idea for optimization was improving the running time of greedy algorithms with the help of the quicksort algorithm. We integrated the greedy algorithm into quicksort to produce a hybrid algorithm, which can solve certain problems significantly faster than the normal greedy algorithm. In the thesis we chose to test hybridization on the activity-selection problem, the fractional knapsack problem, the coin changing problem, Kruskal's algorithm and unit-task scheduling. We experimentally confirmed that hybrid algorithms (do) indeed perform better with the coin changing problem and the fractional knapsack problem.

Item Type:

Thesis (EngD thesis)

Keywords:

greedy, hybridization, algorithms, activity-selection, knapsack, Kruskal, coin-changing, quicksort, unit-tasks

Number of Pages:

Language of Content:

Slovenian

Mentor / Comentors:

Name and Surname	ID	Function
doc. dr. Jurij Mihelič	305	Mentor

Link to COBISS:

http://www.cobiss.si/scripts/cobiss?command=search&base=51012&select=(ID=1537564611)

Institution:

University of Ljubljana

Department:

Faculty of Computer and Information Science

Item ID:

3937

Date Deposited:

13 Sep 2017 13:02

Last Modified:

04 Oct 2017 09:10

URI:

http://eprints.fri.uni-lj.si/id/eprint/3937

Actions (login required)

View Item