ACM Symposium on Discrete Algorithms, SODA 2017


Article Details
Title: Beating Approximation Factor Two for Weighted Tree Augmentation with Bounded Costs
Article URLs:
Alternative Article URLs:
Authors: David Adjiashvili
  • ETH Zürich, Rämistrasse 101, 8092 Zürich, Switzerland, Institute for Operations Research
Sharing: Unknown
Verification: Author has not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/soda/Adjiashvili17
Author Comments:

Discuss this paper and its artifacts below