Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Other Directed Network Design Problems
Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Other Directed Network Design Problems
Previous chapter Next chapter Full AccessProceedings Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms (SODA)Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Other Directed Network Design ProblemsRohan Ghuge and Viswanath NagarajanRohan Ghuge and Viswanath Nagarajanpp.1039 - 1048Chapter DOI:https://doi.org/10.1137/1.9781611975994.63PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAboutAbstract We consider the following general network …