Arrow Research search
Back to SODA

SODA 2017

Negative-Weight Shortest Paths and Unit Capacity Minimum Cost Flow in Õ ( m 10/7 log W ) Time (Extended Abstract)

Conference Paper Accepted Paper Algorithms and Complexity · Theoretical Computer Science

Abstract

No abstract is available in the live database for this paper.

Authors

Keywords

No keywords are indexed for this paper.

Context

Venue
ACM-SIAM Symposium on Discrete Algorithms
Archive span
1990-2025
Indexed papers
4674
Paper id
47411170610900910