New hardness results for routing on disjoint paths

Julia Chuzhoy, David H. K. Kim, Rachit Nimavat. New hardness results for routing on disjoint paths. In Hamed Hatami, Pierre McKenzie, Valerie King, editors, Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017. pages 86-99, ACM, 2017. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.