English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
 DetailsSummary
  O(log 2 k/ log log k)-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial-Time Algorithm

Grandoni, F., Laekhanukit, B., & Li, S. (2019). O(log 2 k/ log log k)-Approximation Algorithm for Directed Steiner Tree: A Tight Quasi-Polynomial-Time Algorithm. In STOC'19 (pp. 253-264). New York, NY: ACM. doi:10.1145/3313276.3316349.

Item is

 

show all hide all

Basic

show hide
Item Permalink: https://hdl.handle.net/21.11116/0000-0003-1625-B Version Permalink: https://hdl.handle.net/21.11116/0000-0004-0531-F
Genre: Conference Paper
Latex : {$O(\log^2k/\log\log{k})$}-Approximation Algorithm for Directed {S}teiner Tree: A Tight Quasi-Polynomial-Time Algorithm

Files

show Files

Locators

show

Creators

show
hide
 Creators:
Grandoni, Fabrizio1, Author           
Laekhanukit, Bundit2, Author           
Li, Shi1, Author
Affiliations:
1External Organizations, ou_persistent22              
2Algorithms and Complexity, MPI for Informatics, Max Planck Society, ou_24019              

Content

show

Details

show
hide
Language(s): eng - English
 Dates: 201920192019
 Publication Status: Issued
 Pages: -
 Publishing info: -
 Table of Contents: -
 Rev. Type: -
 Identifiers: BibTex Citekey: Grandoni_STOC2019
DOI: 10.1145/3313276.3316349
 Degree: -

Event

show
hide
Title: 51st Annual ACM Symposium on the Theory of Computing
Place of Event: Phoenix, AZ, USA
Start-/End Date: 2019-06-23 - 2019-06-26

Legal Case

show

Project information

show

Source 1

show
hide
Title: STOC'19
  Subtitle : Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing
  Abbreviation : STOC 2019
Source Genre: Proceedings
 Creator(s):
Affiliations:
Publ. Info: New York, NY : ACM
Pages: - Volume / Issue: - Sequence Number: - Start / End Page: 253 - 264 Identifier: ISBN: 978-1-4503-6705-9