scientific article; zbMATH DE number 1757952

MaRDI QIDQ4537740zbMATH OpenFDO

Authors Lisa Fleischer

Publication date 20 June 2002

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2081/20810115

Mathematics Subject Classification ID

Connectivity (05C40) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Programming involving graphs or networks (90C35)

Recommendations

• Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
• Publication:4886063
• scientific article; zbMATH DE number 1947057
• An approximation algorithm for minimum-cost vertex-connectivity problems
• Network design via iterative rounding of setpair relaxations

Cited in

(8)

• Approximating minimum size \{1,2\}-connected networks
• Iterative rounding 2-approximation algorithms for minimum-cost vertex connectivity problems
• Constrained surface-level gateway placement for underwater acoustic wireless sensor networks
• A note on iterated rounding for the survivable network design problem
• The parameterized complexity of the survivable network design problem
• Design of survivable networks with low connectivity requirements
• An approximation algorithm for minimum-cost vertex-connectivity problems
• Network design via iterative rounding of setpair relaxations

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 Q4537740)