Beating Approximation Factor Two for Weighted Tree Augmentation with Bounded Costs
Journal article

Beating Approximation Factor Two for Weighted Tree Augmentation with Bounded Costs

Published in:
  • ACM Transactions on Algorithms. - Association for Computing Machinery (ACM). - 2019, vol. 15, no. 2, p. 1-26
Language
  • English
Open access status
closed
Identifiers
Persistent URL
https://fredi.hepvs.ch/global/documents/273952
Statistics

Document views: 19 File downloads: