Approximating k-outconnected subgraph problems

DOI10.1007/BFB0053965MaRDI QIDQ4400846zbMATH OpenFDO

Authors Joseph Cheriyan, Tibor Jordán, Zeev Nutov

Publication date 2 August 1998

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

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

zbMATH Keywords

network design

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 1305534
• scientific article; zbMATH DE number 1542609
• On rooted node-connectivity problems
• Approximation algorithm for k-node connected subgraphs via critical graphs

Cited in

(3)

• scientific article; zbMATH DE number 1305534 (Why is no real title available?)
• scientific article; zbMATH DE number 1542609 (Why is no real title available?)
• On rooted node-connectivity problems

This page was built for publication: Approximating \(k\)-outconnected subgraph problems

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