scientific article; zbMATH DE number 1817738
From MaRDI portal
Publication:3150852
zbMATH Open0996.05108MaRDI QIDQ3150852FDOQ3150852
Authors: T. Hajba 
Publication date: 20 October 2002
Full work available at URL: http://heja.szif.hu/ANM/ANM-001130-A/anm001130a.pdf
Title of this publication is not available (Why is that?)
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)
- 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
- LATIN 2004: Theoretical Informatics
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)
