Randomized algorithms for finding the shortest negative cost cycle in networks
In this paper, we design and analyze a fast, randomized algorithm for the problem of finding a negative cost cycle having the smallest number of edges in a directed, weighted graph. This problem will henceforth be referred to as the Shortest Negative Cost Cycle problem (SNCC). SNCC is closely relate...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier BV,
2020-05-14T19:35:19Z.
|
| Subjects: | |
| Online Access: | Get fulltext |