scientific article; zbMATH DE number 1817738

MaRDI QIDQ3150852zbMATH OpenFDO

Authors T. Hajba

Publication date 20 October 2002

Full work available at URL http://heja.szif.hu/ANM/ANM-001130-A/anm001130a.pdf

zbMATH Keywords

graph algorithms

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)

Recommendations

• Approximation algorithms for \(k\)-connected graph factors
• LATIN 2004: Theoretical Informatics
• An Approximation Algorithm for the Minimum-Cost k-Vertex Connected Subgraph
• Improved Approximation Algorithms for Uniform Connectivity Problems
• Better algorithms for minimum weight vertex-connectivity problems

Cited in

(14)

• LATIN 2004: Theoretical Informatics
• A large subgraph of the minimum weight triangulation
• Approximation algorithms for connected graph factors of minimum weight
• Minimum cost \(\leq k\) edges connected subgraph problems
• Approximation algorithms for multi-parameter graph optimization problems
• Efficient algorithms with performance guarantees for some problems of finding several discrete disjoint subgraphs in complete weighted graph
• An improved approximation algorithm for minimum-cost subset \(k\)-connectivity (extended abstract)
• An optimal rounding for half-integral weighted minimum strongly connected spanning subgraph
• Algorithms for the minimum weight k-fold (connected) dominating set problem
• Algorithms and Data Structures
• Approximation algorithms for \(k\)-connected graph factors
• Better algorithms for minimum weight vertex-connectivity problems
• Graph simplification for infrastructure network design
• Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching

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