Paper Title :A Complex Problem of Knapsack and Shortest Paths on Weighted Graphs
Author :Nadav Voloch, Yair Zadok
Article Citation :Nadav Voloch ,Yair Zadok ,
(2017 ) " A Complex Problem of Knapsack and Shortest Paths on Weighted Graphs " ,
International Journal of Advance Computational Engineering and Networking (IJACEN) ,
pp. 31-34,
Volume-5, Issue-1
Abstract : there are two problems in computer science algorithms, the knapsack problem and the shortest paths on weighted
graphs problem, that are well-known and researched in the past decades. A complex problem that combines these two, as a
two-step problem on the same entities, is the main idea and subject of this paper, in which this combination will be
presented, along with several examples for it.
Index terms- Knapsack problem, Shortest paths on weighted graphs, Dijkstra's algorithm, Dantzig greedy approximation
algoriths, graph theory.
Type : Research paper
Published : Volume-5, Issue-1
DOIONLINE NO - IJACEN-IRAJ-DOIONLINE-6720
View Here
Copyright: © Institute of Research and Journals
| |
 |
| |
 |
PDF |
| |
Viewed - 90 |
| |
Published on 2017-03-07 |
|
