Marko Grgurovič

Marko Grgurovič
University of Primorska | UP · Department of Information Sciences and Technologies

About

5
Publications
1,195
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
10
Citations
Citations since 2017
2 Research Items
8 Citations
20172018201920202021202220230.00.51.01.52.02.53.0
20172018201920202021202220230.00.51.01.52.02.53.0
20172018201920202021202220230.00.51.01.52.02.53.0
20172018201920202021202220230.00.51.01.52.02.53.0

Publications

Publications (5)
Chapter
We study practical algorithms for solving the all-pairs shortest path problem. The Floyd-Warshall algorithm is frequently used to solve the aforementioned problem, and we show how it can be augmented to drastically reduce the number of path combinations examined. Very favorable results are shown via empirical tests that compare the new algorithm wi...
Conference Paper
Full-text available
Given an arbitrary, non-negatively weighted, directed graph G = (V,E) we present an algorithm that computes all pairs shortest paths in time \(\mathcal{O}(m^* n + m \lg n + nT_\psi(m^*, n))\), where m * is the number of different edges contained in shortest paths and T ψ (m *, n) is a running time of an algorithm to solve a single-source shortest p...
Article
Full-text available
Performance analysis of the partial use of a local optimization operator on the genetic algorithm for the Travelling Salesman Problem Background: The Travelling Salesman Problem is an NP-hard problem in combinatorial optimization with a number of practical implications. There are many heuristic algorithms and exact methods for solving the problem....
Article
Full-text available
We consider the problem when visitor wants to visit all interesting sites in a city exactly once and to come back to the hotel. Since, the visitors use streets, walking trails and pedestrian zones, the goal is to minimize the visitor’s traveling. A new problem the Traveling Visitor Problem (TVP) is similar to the Traveling Salesman Problem (TSP) wi...

Network

Cited By