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

James B. Orlin, K. Subramani, Piotr Wojciechowski (2018)

> Home

Details and statistics

DOI: 10.1016/J.DAM.2017.10.011

access: closed

type: Journal Article

metadata version: 2024-02-09

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/dam/OrlinSW18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/OrlinSW18
James B. Orlin, K. Subramani, Piotr Wojciechowski:
Randomized algorithms for finding the shortest negative cost cycle in networks. Discret. Appl. Math. 236: 387-394 (2018)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.