ConceptioArchivearXiv (All)
arXiv (All)open access

A $4/3$ ratio approximation algorithm for the Tree Augmentation Problem by deferred local-ratio and climbing

Kortsarz, Guy
arXiv (All) · Papers · License: Open Access
Open Source ↗Direct PDF ↓
computational-complexity
computational complexity
This document is indexed with metadata only — full text is not available in the archive for this record. Open the official source ↗
Record · ID 1034695
Retrieved via Conceptio — every document is proof-bundled with source, license, and retrieval metadata.