Login / Signup

Randomized algorithms for finding the shortest negative cost cycle in networks.

James B. OrlinK. SubramaniPiotr J. Wojciechowski
Published in: Discret. Appl. Math. (2018)
Keyphrases
  • randomized algorithms
  • path length
  • approximation algorithms
  • social networks
  • learning algorithm
  • lower bound
  • shortest path
  • network structure
  • minimum cost
  • practical problems
  • randomized algorithm
  • machine learning