Approximating rooted connectivity augmentation problems

DOI10.1007/B11961MaRDI QIDQ5900929zbMATH OpenOpenAlexFDO

Authors Zeev Nutov

Publication date 26 May 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b11961

Mathematics Subject Classification ID

Connectivity (05C40) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25)

Recommendations

• Approximating rooted connectivity augmentation problems
• Approximating subset \(k\)-connectivity problems
• Approximating subset k-connectivity problems
• Approximating connectivity augmentation problems
• Tight approximation algorithm for connectivity augmentation problems

Cited in

(5)

• Approximating subset \(k\)-connectivity problems
• Approximating node-connectivity augmentation problems
• Approximating rooted connectivity augmentation problems
• Approximating subset k-connectivity problems
• Approximating connectivity augmentation problems

This page was built for publication: Approximating rooted connectivity augmentation problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5900929)