scientific article; zbMATH DE number 1263175

MaRDI QIDQ4234045zbMATH OpenFDO

Authors Samir Khuller, Balaji Raghavachari

Publication date 3 August 2000

Mathematics Subject Classification ID

Connectivity (05C40) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Cited in

(5)

• Approximating unweighted connectivity problems in parallel
• Better algorithms for minimum weight vertex-connectivity problems
• Fault-tolerant routing: k-inconnected many-to-one routing in wireless networks
• Globally linked pairs and cheapest globally rigid supergraphs
• Improved approximations for flexible network design

This page was built for publication:

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