ACM Symposium on Theory of Computing, STOC 2018

Article Details
Title: Holiest minimum-cost paths and flows in surface graphs
Article URLs:
Alternative Article URLs:
Authors: Jeff Erickson
  • University of Illinois at Urbana-Champaign, Computer Science
Kyle Fox
  • The University of Texas at Dallas, Computer Science
Luvsandondov Lkhamsuren
  • Airbnb
Sharing: Research produced no artifacts
Verification: Authors have verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers: 1408763, 1408846, 1447554, 1513816, 1546392, 1527084, 1535972
DBLP Key: conf/stoc/0001FL18
Author Comments:

Discuss this paper and its artifacts below