STOC 2019
O (log 2 k / log log k )-approximation algorithm for directed Steiner tree: a tight quasi-polynomial-time algorithm
Abstract
No abstract is available in the live database for this paper.
Authors
Keywords
No keywords are indexed for this paper.
Context
- Venue
- ACM Symposium on Theory of Computing
- Archive span
- 1969-2025
- Indexed papers
- 4364
- Paper id
- 522848678337229286