%0 Journal Article %1 journals/dam/OrlinSW18 %A Orlin, James B. %A Subramani, K. %A Wojciechowski, Piotr %D 2018 %J Discret. Appl. Math. %K dblp %P 387-394 %T Randomized algorithms for finding the shortest negative cost cycle in networks. %U http://dblp.uni-trier.de/db/journals/dam/dam236.html#OrlinSW18 %V 236

@article{journals/dam/OrlinSW18, added-at = {2024-02-09T00:00:00.000+0100}, author = {Orlin, James B. and Subramani, K. and Wojciechowski, Piotr}, biburl = {https://www.bibsonomy.org/bibtex/29977af9f3ea897bf208a712b9fdf9709/dblp}, ee = {https://doi.org/10.1016/j.dam.2017.10.011}, interhash = {1461b748d3cbd3ce6ae43888e794fa13}, intrahash = {9977af9f3ea897bf208a712b9fdf9709}, journal = {Discret. Appl. Math.}, keywords = {dblp}, pages = {387-394}, timestamp = {2024-04-09T01:29:00.000+0200}, title = {Randomized algorithms for finding the shortest negative cost cycle in networks.}, url = {http://dblp.uni-trier.de/db/journals/dam/dam236.html#OrlinSW18}, volume = 236, year = 2018 }